/usr/bin/java -ea -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_natnum.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:20:12,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:20:12,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:20:12,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:20:12,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:20:12,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:20:12,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:20:12,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:20:12,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:20:12,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:20:12,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:20:12,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:20:12,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:20:12,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:20:12,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:20:12,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:20:12,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:20:12,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:20:12,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:20:12,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:20:12,794 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:20:12,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:20:12,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:20:12,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:20:12,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:20:12,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:20:12,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:20:12,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:20:12,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:20:12,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:20:12,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:20:12,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:20:12,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:20:12,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:20:12,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:20:12,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:20:12,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:20:12,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:20:12,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:20:12,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:20:12,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:20:12,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:20:12,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:20:12,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:20:12,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:20:12,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:20:12,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:20:12,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:20:12,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:20:12,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:20:12,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:20:12,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:20:12,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:20:12,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:20:12,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:20:12,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:20:12,824 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:20:12,824 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:20:12,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:20:12,824 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:20:12,824 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-04-08 10:20:13,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:20:13,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:20:13,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:20:13,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:20:13,044 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:20:13,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-08 10:20:13,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f43b30e0/9107329681d64e1fb82f609c02ab0773/FLAG850b3a154 [2022-04-08 10:20:13,449 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:20:13,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-08 10:20:13,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f43b30e0/9107329681d64e1fb82f609c02ab0773/FLAG850b3a154 [2022-04-08 10:20:13,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f43b30e0/9107329681d64e1fb82f609c02ab0773 [2022-04-08 10:20:13,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:20:13,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:20:13,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:20:13,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:20:13,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:20:13,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2488fca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13, skipping insertion in model container [2022-04-08 10:20:13,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:20:13,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:20:13,629 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_natnum.c[458,471] [2022-04-08 10:20:13,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:20:13,661 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:20:13,670 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_natnum.c[458,471] [2022-04-08 10:20:13,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:20:13,683 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:20:13,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13 WrapperNode [2022-04-08 10:20:13,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:20:13,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:20:13,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:20:13,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:20:13,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:20:13,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:20:13,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:20:13,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:20:13,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (1/1) ... [2022-04-08 10:20:13,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:20:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:13,742 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-04-08 10:20:13,759 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-04-08 10:20:13,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:20:13,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:20:13,780 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:20:13,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:20:13,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:20:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:20:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:20:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:20:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:20:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:20:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:20:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:20:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:20:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:20:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:20:13,833 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:20:13,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:20:13,947 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:20:13,952 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:20:13,952 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:20:13,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:20:13 BoogieIcfgContainer [2022-04-08 10:20:13,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:20:13,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:20:13,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:20:13,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:20:13,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:20:13" (1/3) ... [2022-04-08 10:20:13,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8f575c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:20:13, skipping insertion in model container [2022-04-08 10:20:13,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:20:13" (2/3) ... [2022-04-08 10:20:13,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8f575c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:20:13, skipping insertion in model container [2022-04-08 10:20:13,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:20:13" (3/3) ... [2022-04-08 10:20:13,970 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_natnum.c [2022-04-08 10:20:13,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:20:13,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:20:14,000 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:20:14,004 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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 [2022-04-08 10:20:14,004 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:20:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-04-08 10:20:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 10:20:14,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:14,020 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:14,020 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 1 times [2022-04-08 10:20:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:14,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1944958296] [2022-04-08 10:20:14,062 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:20:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 2 times [2022-04-08 10:20:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948707163] [2022-04-08 10:20:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:14,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:14,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671322992] [2022-04-08 10:20:14,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:20:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:14,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:14,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:20:14,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:20:14,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 10:20:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:14,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:14,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2022-04-08 10:20:14,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:14,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(<= 40000 ~SIZE~0)} assume true; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:14,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#(<= 40000 ~SIZE~0)} {22#true} #45#return; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:14,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:14,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:14,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {23#false} is VALID [2022-04-08 10:20:14,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23#false} is VALID [2022-04-08 10:20:14,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 10:20:14,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 10:20:14,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 10:20:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:14,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:20:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948707163] [2022-04-08 10:20:14,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671322992] [2022-04-08 10:20:14,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671322992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:14,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:14,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:20:14,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:14,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1944958296] [2022-04-08 10:20:14,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1944958296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:14,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:14,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:20:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659796708] [2022-04-08 10:20:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 10:20:14,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:14,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-04-08 10:20:14,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:14,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:20:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:20:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:20:14,478 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-04-08 10:20:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:20,656 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:20:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:20:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 10:20:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-04-08 10:20:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 10:20:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-04-08 10:20:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 10:20:20,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 10:20:20,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:20,703 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:20:20,703 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 10:20:20,705 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:20:20,708 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:20,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:20:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 10:20:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 10:20:20,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:20,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-08 10:20:20,733 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-08 10:20:20,733 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-08 10:20:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:20,735 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:20:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:20:20,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:20,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:20,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-08 10:20:20,736 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-08 10:20:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:20,737 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:20:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:20:20,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:20,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:20,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:20,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-08 10:20:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 10:20:20,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 10:20:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:20,740 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 10:20:20,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-04-08 10:20:20,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 10:20:20,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:20:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:20:20,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:20,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:20,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:20:20,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 10:20:20,955 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 1 times [2022-04-08 10:20:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819314153] [2022-04-08 10:20:20,988 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:20,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 2 times [2022-04-08 10:20:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674389111] [2022-04-08 10:20:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:21,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:21,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44614613] [2022-04-08 10:20:21,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:20:21,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:21,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:21,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:20:21,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:20:21,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:21,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:20:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:21,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:21,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-08 10:20:21,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:21,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#(<= 40000 ~SIZE~0)} assume true; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:21,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#(<= 40000 ~SIZE~0)} {174#true} #45#return; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:21,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:21,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:21,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:21,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {175#false} is VALID [2022-04-08 10:20:21,234 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {175#false} is VALID [2022-04-08 10:20:21,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-08 10:20:21,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-08 10:20:21,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-08 10:20:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:21,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:21,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-08 10:20:21,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-08 10:20:21,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-08 10:20:21,334 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {175#false} is VALID [2022-04-08 10:20:21,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {175#false} is VALID [2022-04-08 10:20:21,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {227#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:21,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(< 1 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {231#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:21,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(< 1 ~SIZE~0)} call #t~ret4 := main(); {235#(< 1 ~SIZE~0)} is VALID [2022-04-08 10:20:21,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(< 1 ~SIZE~0)} {174#true} #45#return; {235#(< 1 ~SIZE~0)} is VALID [2022-04-08 10:20:21,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(< 1 ~SIZE~0)} assume true; {235#(< 1 ~SIZE~0)} is VALID [2022-04-08 10:20:21,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {235#(< 1 ~SIZE~0)} is VALID [2022-04-08 10:20:21,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-08 10:20:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:21,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:21,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674389111] [2022-04-08 10:20:21,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44614613] [2022-04-08 10:20:21,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44614613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:21,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:21,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 10:20:21,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:21,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819314153] [2022-04-08 10:20:21,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819314153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:21,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:21,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:20:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757348731] [2022-04-08 10:20:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 10:20:21,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:21,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-08 10:20:21,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:21,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:20:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:20:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:20:21,356 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-08 10:20:27,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:20:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:27,234 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:20:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:20:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 10:20:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-08 10:20:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 10:20:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-08 10:20:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 10:20:27,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-08 10:20:27,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:27,253 INFO L225 Difference]: With dead ends: 19 [2022-04-08 10:20:27,253 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 10:20:27,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:20:27,255 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:27,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:20:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 10:20:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 10:20:27,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:27,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-08 10:20:27,266 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-08 10:20:27,266 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-08 10:20:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:27,267 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 10:20:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 10:20:27,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:27,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:27,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 14 states. [2022-04-08 10:20:27,268 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 14 states. [2022-04-08 10:20:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:27,269 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 10:20:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 10:20:27,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:27,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:27,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:27,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-08 10:20:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 10:20:27,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 10:20:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:27,271 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 10:20:27,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-04-08 10:20:27,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 10:20:27,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 10:20:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 10:20:27,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:27,284 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:27,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 10:20:27,494 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 252886155, now seen corresponding path program 3 times [2022-04-08 10:20:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:27,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184443829] [2022-04-08 10:20:27,498 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:27,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 252886155, now seen corresponding path program 4 times [2022-04-08 10:20:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203698284] [2022-04-08 10:20:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:27,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:27,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809952723] [2022-04-08 10:20:27,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:20:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:27,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:27,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:20:27,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:20:27,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:27,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 10:20:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:27,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:27,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-08 10:20:27,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:27,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(<= 40000 ~SIZE~0)} assume true; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:27,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#(<= 40000 ~SIZE~0)} {347#true} #45#return; {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:27,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {355#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:27,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {368#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:27,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {372#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:27,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:27,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !(~i~0 < ~SIZE~0); {348#false} is VALID [2022-04-08 10:20:27,714 INFO L272 TraceCheckUtils]: 9: Hoare triple {348#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {348#false} is VALID [2022-04-08 10:20:27,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-04-08 10:20:27,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-04-08 10:20:27,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-08 10:20:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:27,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:27,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-08 10:20:27,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-04-08 10:20:27,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-04-08 10:20:27,812 INFO L272 TraceCheckUtils]: 9: Hoare triple {348#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {348#false} is VALID [2022-04-08 10:20:27,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {348#false} is VALID [2022-04-08 10:20:27,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {404#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:27,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {408#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:27,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#(< 2 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {412#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:27,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#(< 2 ~SIZE~0)} call #t~ret4 := main(); {416#(< 2 ~SIZE~0)} is VALID [2022-04-08 10:20:27,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#(< 2 ~SIZE~0)} {347#true} #45#return; {416#(< 2 ~SIZE~0)} is VALID [2022-04-08 10:20:27,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#(< 2 ~SIZE~0)} assume true; {416#(< 2 ~SIZE~0)} is VALID [2022-04-08 10:20:27,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {416#(< 2 ~SIZE~0)} is VALID [2022-04-08 10:20:27,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-08 10:20:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:27,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203698284] [2022-04-08 10:20:27,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:27,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809952723] [2022-04-08 10:20:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809952723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:27,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 10:20:27,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184443829] [2022-04-08 10:20:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184443829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:27,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:20:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304653865] [2022-04-08 10:20:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-08 10:20:27,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:27,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-04-08 10:20:27,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:27,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:20:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:20:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:20:27,834 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-04-08 10:20:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,125 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:20:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:20:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-08 10:20:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-04-08 10:20:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:20:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-04-08 10:20:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:20:34,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 10:20:34,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:34,148 INFO L225 Difference]: With dead ends: 20 [2022-04-08 10:20:34,149 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:20:34,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:20:34,150 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:34,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:20:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:20:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:20:34,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:34,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-04-08 10:20:34,177 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-04-08 10:20:34,177 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-04-08 10:20:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,178 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:20:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:20:34,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:34,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:34,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) Second operand 15 states. [2022-04-08 10:20:34,179 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) Second operand 15 states. [2022-04-08 10:20:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,180 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:20:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:20:34,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:34,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:34,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:34,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-04-08 10:20:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 10:20:34,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 10:20:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:34,181 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 10:20:34,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-04-08 10:20:34,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 10:20:34,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:20:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:20:34,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:34,196 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:34,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:34,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:34,412 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash -715968718, now seen corresponding path program 5 times [2022-04-08 10:20:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1041084554] [2022-04-08 10:20:34,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:34,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash -715968718, now seen corresponding path program 6 times [2022-04-08 10:20:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973760403] [2022-04-08 10:20:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:34,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:34,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794776498] [2022-04-08 10:20:34,431 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:20:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:34,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:34,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:34,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:20:34,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:20:34,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:34,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:20:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:34,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:34,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-08 10:20:34,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:34,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#(<= 40000 ~SIZE~0)} assume true; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:34,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#(<= 40000 ~SIZE~0)} {534#true} #45#return; {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:34,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:34,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:34,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:34,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:34,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:34,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !(~i~0 < ~SIZE~0); {535#false} is VALID [2022-04-08 10:20:34,628 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {535#false} is VALID [2022-04-08 10:20:34,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-08 10:20:34,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-08 10:20:34,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-08 10:20:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:34,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:34,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-08 10:20:34,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-08 10:20:34,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-08 10:20:34,748 INFO L272 TraceCheckUtils]: 10: Hoare triple {535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {535#false} is VALID [2022-04-08 10:20:34,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {535#false} is VALID [2022-04-08 10:20:34,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {595#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:34,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {599#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:34,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {603#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:34,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(< 3 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {607#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:34,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {611#(< 3 ~SIZE~0)} call #t~ret4 := main(); {611#(< 3 ~SIZE~0)} is VALID [2022-04-08 10:20:34,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {611#(< 3 ~SIZE~0)} {534#true} #45#return; {611#(< 3 ~SIZE~0)} is VALID [2022-04-08 10:20:34,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {611#(< 3 ~SIZE~0)} assume true; {611#(< 3 ~SIZE~0)} is VALID [2022-04-08 10:20:34,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {611#(< 3 ~SIZE~0)} is VALID [2022-04-08 10:20:34,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-08 10:20:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:34,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973760403] [2022-04-08 10:20:34,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:34,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794776498] [2022-04-08 10:20:34,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794776498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:34,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:34,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 10:20:34,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:34,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1041084554] [2022-04-08 10:20:34,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1041084554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:34,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:34,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:20:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354944917] [2022-04-08 10:20:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:34,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-08 10:20:34,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:34,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-04-08 10:20:34,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:34,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:20:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:20:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:20:34,764 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-04-08 10:20:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,828 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:20:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:20:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-08 10:20:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-04-08 10:20:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 10:20:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-04-08 10:20:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 10:20:34,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-08 10:20:34,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:34,860 INFO L225 Difference]: With dead ends: 21 [2022-04-08 10:20:34,860 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 10:20:34,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:20:34,863 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:34,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:20:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 10:20:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 10:20:34,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:34,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-04-08 10:20:34,875 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-04-08 10:20:34,875 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-04-08 10:20:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,876 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 10:20:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:20:34,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:34,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:34,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) Second operand 16 states. [2022-04-08 10:20:34,876 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) Second operand 16 states. [2022-04-08 10:20:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:34,877 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 10:20:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:20:34,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:34,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:34,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:34,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-04-08 10:20:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 10:20:34,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 10:20:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:34,879 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 10:20:34,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-04-08 10:20:34,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 10:20:34,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:20:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:20:34,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:34,889 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:34,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 10:20:35,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:35,106 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash -685698709, now seen corresponding path program 7 times [2022-04-08 10:20:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:35,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947057719] [2022-04-08 10:20:35,109 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:35,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -685698709, now seen corresponding path program 8 times [2022-04-08 10:20:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100338631] [2022-04-08 10:20:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:35,130 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:35,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393122041] [2022-04-08 10:20:35,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:20:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:35,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:20:35,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:20:35,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:35,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:20:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:35,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:35,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-08 10:20:35,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:35,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#(<= 40000 ~SIZE~0)} assume true; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:35,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#(<= 40000 ~SIZE~0)} {735#true} #45#return; {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:35,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {743#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:35,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {756#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:35,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {756#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {760#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:35,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:35,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:35,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {772#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:20:35,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !(~i~0 < ~SIZE~0); {736#false} is VALID [2022-04-08 10:20:35,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {736#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {736#false} is VALID [2022-04-08 10:20:35,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-08 10:20:35,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-08 10:20:35,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-08 10:20:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:35,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:35,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-08 10:20:35,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-08 10:20:35,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-08 10:20:35,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {736#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {736#false} is VALID [2022-04-08 10:20:35,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {736#false} is VALID [2022-04-08 10:20:35,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {800#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:35,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {804#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:35,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {808#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:35,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {812#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:35,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {820#(< 4 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {816#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:20:35,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {820#(< 4 ~SIZE~0)} call #t~ret4 := main(); {820#(< 4 ~SIZE~0)} is VALID [2022-04-08 10:20:35,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {820#(< 4 ~SIZE~0)} {735#true} #45#return; {820#(< 4 ~SIZE~0)} is VALID [2022-04-08 10:20:35,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {820#(< 4 ~SIZE~0)} assume true; {820#(< 4 ~SIZE~0)} is VALID [2022-04-08 10:20:35,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {820#(< 4 ~SIZE~0)} is VALID [2022-04-08 10:20:35,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-08 10:20:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100338631] [2022-04-08 10:20:35,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393122041] [2022-04-08 10:20:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393122041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:35,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 10:20:35,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947057719] [2022-04-08 10:20:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947057719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:35,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:20:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347695208] [2022-04-08 10:20:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:35,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 10:20:35,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:35,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-04-08 10:20:35,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:35,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:20:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:20:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:20:35,607 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-04-08 10:20:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:35,903 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:20:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:20:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 10:20:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-04-08 10:20:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 10:20:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-04-08 10:20:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 10:20:35,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 10:20:35,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:35,931 INFO L225 Difference]: With dead ends: 22 [2022-04-08 10:20:35,931 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:20:35,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:20:35,932 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:35,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:20:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:20:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:20:35,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:35,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-04-08 10:20:35,946 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-04-08 10:20:35,946 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-04-08 10:20:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:35,947 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:20:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:20:35,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:35,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:35,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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) Second operand 17 states. [2022-04-08 10:20:35,947 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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) Second operand 17 states. [2022-04-08 10:20:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:35,948 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:20:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:20:35,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:35,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:35,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:35,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-04-08 10:20:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 10:20:35,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 10:20:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:35,949 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 10:20:35,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-04-08 10:20:35,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 10:20:35,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:20:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:20:35,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:35,963 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:35,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 10:20:36,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:36,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 252671570, now seen corresponding path program 9 times [2022-04-08 10:20:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100791999] [2022-04-08 10:20:36,185 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:36,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 252671570, now seen corresponding path program 10 times [2022-04-08 10:20:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:36,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274314013] [2022-04-08 10:20:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:36,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844943227] [2022-04-08 10:20:36,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:20:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:36,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 10:20:36,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:20:36,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:36,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:20:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:36,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:36,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} call ULTIMATE.init(); {950#true} is VALID [2022-04-08 10:20:36,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:36,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {958#(<= 40000 ~SIZE~0)} assume true; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:36,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {958#(<= 40000 ~SIZE~0)} {950#true} #45#return; {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:36,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {958#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:36,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {958#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:36,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:36,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:36,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:36,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:20:36,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:36,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {951#false} is VALID [2022-04-08 10:20:36,469 INFO L272 TraceCheckUtils]: 12: Hoare triple {951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {951#false} is VALID [2022-04-08 10:20:36,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#false} ~cond := #in~cond; {951#false} is VALID [2022-04-08 10:20:36,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#false} assume 0 == ~cond; {951#false} is VALID [2022-04-08 10:20:36,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-04-08 10:20:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:36,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:36,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-04-08 10:20:36,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#false} assume 0 == ~cond; {951#false} is VALID [2022-04-08 10:20:36,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#false} ~cond := #in~cond; {951#false} is VALID [2022-04-08 10:20:36,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {951#false} is VALID [2022-04-08 10:20:36,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {951#false} is VALID [2022-04-08 10:20:36,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1023#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1019#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:36,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1023#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:36,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1027#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:36,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1035#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1031#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:36,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {1039#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1035#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:20:36,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {1043#(< 5 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1039#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:36,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {1043#(< 5 ~SIZE~0)} call #t~ret4 := main(); {1043#(< 5 ~SIZE~0)} is VALID [2022-04-08 10:20:36,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1043#(< 5 ~SIZE~0)} {950#true} #45#return; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-08 10:20:36,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1043#(< 5 ~SIZE~0)} assume true; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-08 10:20:36,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1043#(< 5 ~SIZE~0)} is VALID [2022-04-08 10:20:36,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} call ULTIMATE.init(); {950#true} is VALID [2022-04-08 10:20:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:36,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274314013] [2022-04-08 10:20:36,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:36,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844943227] [2022-04-08 10:20:36,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844943227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:36,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:36,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 10:20:36,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100791999] [2022-04-08 10:20:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100791999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:20:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153576654] [2022-04-08 10:20:36,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:36,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:36,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:36,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:36,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:20:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:36,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:20:36,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:20:36,645 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:42,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:20:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:42,738 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:20:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:20:42,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 10:20:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 10:20:42,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 10:20:42,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:42,755 INFO L225 Difference]: With dead ends: 23 [2022-04-08 10:20:42,755 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:20:42,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:20:42,756 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:42,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 10:20:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:20:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 10:20:42,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:42,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-04-08 10:20:42,769 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-04-08 10:20:42,769 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-04-08 10:20:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:42,770 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 10:20:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:20:42,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:42,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:42,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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) Second operand 18 states. [2022-04-08 10:20:42,771 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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) Second operand 18 states. [2022-04-08 10:20:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:42,771 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 10:20:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:20:42,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:42,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:42,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:42,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-04-08 10:20:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 10:20:42,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 10:20:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:42,773 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 10:20:42,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04-08 10:20:42,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 10:20:42,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:20:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:20:42,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:42,786 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:42,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:42,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:42,988 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -722620853, now seen corresponding path program 11 times [2022-04-08 10:20:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:42,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835165815] [2022-04-08 10:20:42,991 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:42,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -722620853, now seen corresponding path program 12 times [2022-04-08 10:20:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238085587] [2022-04-08 10:20:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:43,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:43,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971630707] [2022-04-08 10:20:43,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:20:43,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:43,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:43,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 10:20:43,041 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:20:43,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:43,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:20:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:43,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:43,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-08 10:20:43,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:43,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#(<= 40000 ~SIZE~0)} assume true; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:43,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#(<= 40000 ~SIZE~0)} {1179#true} #45#return; {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:43,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1187#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:43,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1200#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:43,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1204#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:43,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1204#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1208#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:43,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {1208#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1212#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:43,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1216#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:20:43,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1220#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:43,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {1220#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1224#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:20:43,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !(~i~0 < ~SIZE~0); {1180#false} is VALID [2022-04-08 10:20:43,256 INFO L272 TraceCheckUtils]: 13: Hoare triple {1180#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1180#false} is VALID [2022-04-08 10:20:43,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {1180#false} ~cond := #in~cond; {1180#false} is VALID [2022-04-08 10:20:43,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#false} assume 0 == ~cond; {1180#false} is VALID [2022-04-08 10:20:43,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-08 10:20:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:43,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:43,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-08 10:20:43,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#false} assume 0 == ~cond; {1180#false} is VALID [2022-04-08 10:20:43,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {1180#false} ~cond := #in~cond; {1180#false} is VALID [2022-04-08 10:20:43,449 INFO L272 TraceCheckUtils]: 13: Hoare triple {1180#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1180#false} is VALID [2022-04-08 10:20:43,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1180#false} is VALID [2022-04-08 10:20:43,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1252#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:43,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1256#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:43,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1260#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:43,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1264#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:43,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1268#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:20:43,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1272#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:43,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#(< 6 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1276#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:20:43,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {1280#(< 6 ~SIZE~0)} call #t~ret4 := main(); {1280#(< 6 ~SIZE~0)} is VALID [2022-04-08 10:20:43,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1280#(< 6 ~SIZE~0)} {1179#true} #45#return; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-08 10:20:43,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(< 6 ~SIZE~0)} assume true; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-08 10:20:43,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1280#(< 6 ~SIZE~0)} is VALID [2022-04-08 10:20:43,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-08 10:20:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238085587] [2022-04-08 10:20:43,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971630707] [2022-04-08 10:20:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971630707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:43,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:43,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 10:20:43,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835165815] [2022-04-08 10:20:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835165815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:43,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:43,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:20:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739573991] [2022-04-08 10:20:43,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:43,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:43,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:43,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:43,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:20:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:20:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:20:43,475 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:45,579 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:20:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:20:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 10:20:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 10:20:45,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-08 10:20:45,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:45,607 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:20:45,608 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:20:45,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:20:45,608 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:45,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:20:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:20:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:20:45,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:45,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-04-08 10:20:45,621 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-04-08 10:20:45,621 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-04-08 10:20:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:45,622 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:20:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:20:45,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:45,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:45,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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) Second operand 19 states. [2022-04-08 10:20:45,622 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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) Second operand 19 states. [2022-04-08 10:20:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:45,623 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:20:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:20:45,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:45,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:45,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:45,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-04-08 10:20:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 10:20:45,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-08 10:20:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:45,624 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 10:20:45,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) 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-04-08 10:20:45,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 10:20:45,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:20:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:20:45,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:45,640 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:45,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:45,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:45,855 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -891914894, now seen corresponding path program 13 times [2022-04-08 10:20:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:45,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981474684] [2022-04-08 10:20:45,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:45,859 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -891914894, now seen corresponding path program 14 times [2022-04-08 10:20:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:45,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024137460] [2022-04-08 10:20:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:45,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:45,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472825064] [2022-04-08 10:20:45,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:20:45,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:45,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 10:20:45,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:20:45,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:45,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:20:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:45,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:46,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2022-04-08 10:20:46,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:46,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#(<= 40000 ~SIZE~0)} assume true; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:46,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#(<= 40000 ~SIZE~0)} {1422#true} #45#return; {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:46,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1430#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:46,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1443#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:46,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {1443#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1447#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:46,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {1447#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:46,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1455#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:46,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:20:46,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {1459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1463#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:46,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1463#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:20:46,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1471#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:46,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {1471#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {1423#false} is VALID [2022-04-08 10:20:46,114 INFO L272 TraceCheckUtils]: 14: Hoare triple {1423#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1423#false} is VALID [2022-04-08 10:20:46,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2022-04-08 10:20:46,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2022-04-08 10:20:46,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2022-04-08 10:20:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:46,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:46,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2022-04-08 10:20:46,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2022-04-08 10:20:46,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2022-04-08 10:20:46,338 INFO L272 TraceCheckUtils]: 14: Hoare triple {1423#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1423#false} is VALID [2022-04-08 10:20:46,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1423#false} is VALID [2022-04-08 10:20:46,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1499#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:46,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1503#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:46,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1507#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:46,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1515#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1511#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:46,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1515#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:20:46,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1519#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:46,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1523#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:20:46,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#(< 7 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1527#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:46,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#(< 7 ~SIZE~0)} call #t~ret4 := main(); {1531#(< 7 ~SIZE~0)} is VALID [2022-04-08 10:20:46,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#(< 7 ~SIZE~0)} {1422#true} #45#return; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-08 10:20:46,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#(< 7 ~SIZE~0)} assume true; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-08 10:20:46,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1531#(< 7 ~SIZE~0)} is VALID [2022-04-08 10:20:46,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2022-04-08 10:20:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:46,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024137460] [2022-04-08 10:20:46,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472825064] [2022-04-08 10:20:46,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472825064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:46,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:46,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 10:20:46,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:46,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981474684] [2022-04-08 10:20:46,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981474684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:46,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:46,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:20:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114166809] [2022-04-08 10:20:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:46,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:46,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:46,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:46,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:46,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:20:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:46,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:20:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:20:46,358 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:50,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:20:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:52,458 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:20:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:20:52,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-08 10:20:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-08 10:20:52,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-08 10:20:52,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:52,482 INFO L225 Difference]: With dead ends: 25 [2022-04-08 10:20:52,482 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:20:52,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:20:52,483 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:52,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 10:20:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:20:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 10:20:52,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:52,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-04-08 10:20:52,498 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-04-08 10:20:52,499 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-04-08 10:20:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:52,501 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:20:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:20:52,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:52,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:52,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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) Second operand 20 states. [2022-04-08 10:20:52,501 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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) Second operand 20 states. [2022-04-08 10:20:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:52,502 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:20:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:20:52,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:52,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:52,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:52,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-04-08 10:20:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 10:20:52,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-08 10:20:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:52,505 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 10:20:52,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) 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-04-08 10:20:52,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 10:20:52,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:20:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:20:52,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:52,521 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:52,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:52,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 10:20:52,731 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1845062869, now seen corresponding path program 15 times [2022-04-08 10:20:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036866024] [2022-04-08 10:20:52,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:52,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1845062869, now seen corresponding path program 16 times [2022-04-08 10:20:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5914380] [2022-04-08 10:20:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:52,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:52,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391644062] [2022-04-08 10:20:52,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:20:52,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:52,764 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:52,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 10:20:52,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:20:52,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:20:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:52,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:20:53,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2022-04-08 10:20:53,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:53,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#(<= 40000 ~SIZE~0)} assume true; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:53,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#(<= 40000 ~SIZE~0)} {1679#true} #45#return; {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:53,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1687#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:20:53,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1700#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:53,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {1700#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1704#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:53,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1704#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1708#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:20:53,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1708#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:20:53,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:20:53,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {1716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1720#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:53,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:20:53,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1728#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:20:53,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:20:53,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !(~i~0 < ~SIZE~0); {1680#false} is VALID [2022-04-08 10:20:53,041 INFO L272 TraceCheckUtils]: 15: Hoare triple {1680#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1680#false} is VALID [2022-04-08 10:20:53,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2022-04-08 10:20:53,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {1680#false} assume 0 == ~cond; {1680#false} is VALID [2022-04-08 10:20:53,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2022-04-08 10:20:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:53,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:20:53,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2022-04-08 10:20:53,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {1680#false} assume 0 == ~cond; {1680#false} is VALID [2022-04-08 10:20:53,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2022-04-08 10:20:53,321 INFO L272 TraceCheckUtils]: 15: Hoare triple {1680#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1680#false} is VALID [2022-04-08 10:20:53,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1680#false} is VALID [2022-04-08 10:20:53,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1764#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1760#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:20:53,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {1768#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1764#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:20:53,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1768#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:20:53,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1776#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1772#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:20:53,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1776#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:20:53,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1780#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:53,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1784#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:20:53,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1788#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:20:53,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#(< 8 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1792#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:20:53,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#(< 8 ~SIZE~0)} call #t~ret4 := main(); {1796#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:20:53,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#(< 8 ~SIZE~0)} {1679#true} #45#return; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:20:53,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#(< 8 ~SIZE~0)} assume true; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:20:53,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1796#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:20:53,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2022-04-08 10:20:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:20:53,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:20:53,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5914380] [2022-04-08 10:20:53,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:20:53,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391644062] [2022-04-08 10:20:53,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391644062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:20:53,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:20:53,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 10:20:53,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:20:53,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036866024] [2022-04-08 10:20:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036866024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:20:53,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:20:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:20:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047042400] [2022-04-08 10:20:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:20:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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) Word has length 19 [2022-04-08 10:20:53,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:20:53,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-04-08 10:20:53,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:53,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:20:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:20:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:20:53,357 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-04-08 10:20:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:59,462 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:20:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:20:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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) Word has length 19 [2022-04-08 10:20:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:20:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-04-08 10:20:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 10:20:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-04-08 10:20:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 10:20:59,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-08 10:20:59,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:59,480 INFO L225 Difference]: With dead ends: 26 [2022-04-08 10:20:59,480 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:20:59,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:20:59,481 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:20:59,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:20:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:20:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 10:20:59,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:20:59,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-04-08 10:20:59,497 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-04-08 10:20:59,497 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-04-08 10:20:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:59,498 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:20:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:20:59,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:59,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:59,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) Second operand 21 states. [2022-04-08 10:20:59,498 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) Second operand 21 states. [2022-04-08 10:20:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:20:59,499 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:20:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:20:59,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:20:59,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:20:59,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:20:59,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:20:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-04-08 10:20:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-08 10:20:59,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-08 10:20:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:20:59,500 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-08 10:20:59,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-04-08 10:20:59,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-08 10:20:59,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:20:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:20:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:20:59,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:20:59,521 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:20:59,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 10:20:59,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:59,722 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:20:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:20:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1327879022, now seen corresponding path program 17 times [2022-04-08 10:20:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:20:59,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912869762] [2022-04-08 10:20:59,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:20:59,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:20:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1327879022, now seen corresponding path program 18 times [2022-04-08 10:20:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:20:59,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823644080] [2022-04-08 10:20:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:20:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:20:59,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:20:59,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826539720] [2022-04-08 10:20:59,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:20:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:20:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:20:59,737 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:20:59,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 10:20:59,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:20:59,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:20:59,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:20:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:20:59,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:00,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2022-04-08 10:21:00,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:00,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {1958#(<= 40000 ~SIZE~0)} assume true; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:00,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1958#(<= 40000 ~SIZE~0)} {1950#true} #45#return; {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:00,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1958#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1958#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:00,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1958#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:00,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:00,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1975#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:00,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:00,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:00,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {1987#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:00,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1991#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1995#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:00,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1995#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {1999#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:00,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {1999#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2003#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:00,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {2003#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:00,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {2007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !(~i~0 < ~SIZE~0); {1951#false} is VALID [2022-04-08 10:21:00,048 INFO L272 TraceCheckUtils]: 16: Hoare triple {1951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1951#false} is VALID [2022-04-08 10:21:00,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2022-04-08 10:21:00,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {1951#false} assume 0 == ~cond; {1951#false} is VALID [2022-04-08 10:21:00,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2022-04-08 10:21:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:00,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:00,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2022-04-08 10:21:00,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {1951#false} assume 0 == ~cond; {1951#false} is VALID [2022-04-08 10:21:00,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2022-04-08 10:21:00,305 INFO L272 TraceCheckUtils]: 16: Hoare triple {1951#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1951#false} is VALID [2022-04-08 10:21:00,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1951#false} is VALID [2022-04-08 10:21:00,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2035#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:00,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2039#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:00,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {2047#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2043#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:00,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2051#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2047#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:00,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {2055#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2051#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:00,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {2059#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2055#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:00,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2059#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:00,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {2067#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2063#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:00,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2067#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:00,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#(< 9 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2071#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:00,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {2075#(< 9 ~SIZE~0)} call #t~ret4 := main(); {2075#(< 9 ~SIZE~0)} is VALID [2022-04-08 10:21:00,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2075#(< 9 ~SIZE~0)} {1950#true} #45#return; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-08 10:21:00,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#(< 9 ~SIZE~0)} assume true; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-08 10:21:00,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2075#(< 9 ~SIZE~0)} is VALID [2022-04-08 10:21:00,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2022-04-08 10:21:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:00,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823644080] [2022-04-08 10:21:00,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826539720] [2022-04-08 10:21:00,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826539720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:00,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:00,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 10:21:00,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912869762] [2022-04-08 10:21:00,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912869762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:00,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:00,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:21:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112736208] [2022-04-08 10:21:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) Word has length 20 [2022-04-08 10:21:00,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:00,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-04-08 10:21:00,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:00,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:21:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:21:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:21:00,344 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-04-08 10:21:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:05,463 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:21:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:21:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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) Word has length 20 [2022-04-08 10:21:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-04-08 10:21:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-08 10:21:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-04-08 10:21:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-08 10:21:05,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-08 10:21:05,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:05,490 INFO L225 Difference]: With dead ends: 27 [2022-04-08 10:21:05,490 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:21:05,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:21:05,491 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:05,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:21:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:21:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 10:21:05,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:05,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-04-08 10:21:05,510 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-04-08 10:21:05,511 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-04-08 10:21:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:05,511 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:21:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:21:05,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:05,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:05,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 22 states. [2022-04-08 10:21:05,512 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 22 states. [2022-04-08 10:21:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:05,512 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:21:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:21:05,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:05,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:05,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:05,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-04-08 10:21:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 10:21:05,513 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-08 10:21:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:05,513 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 10:21:05,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-04-08 10:21:05,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 10:21:05,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:21:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:21:05,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:05,534 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:05,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:05,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:21:05,735 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918347, now seen corresponding path program 19 times [2022-04-08 10:21:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:05,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331631533] [2022-04-08 10:21:05,746 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:05,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918347, now seen corresponding path program 20 times [2022-04-08 10:21:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535296098] [2022-04-08 10:21:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:05,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:05,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875586962] [2022-04-08 10:21:05,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:21:05,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:05,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:05,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:05,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 10:21:05,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:21:05,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:05,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:21:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:05,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:06,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {2235#true} call ULTIMATE.init(); {2235#true} is VALID [2022-04-08 10:21:06,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:06,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2243#(<= 40000 ~SIZE~0)} assume true; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:06,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2243#(<= 40000 ~SIZE~0)} {2235#true} #45#return; {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:06,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {2243#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2243#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:06,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {2243#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2256#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:06,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {2256#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2260#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:06,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2264#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:06,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:06,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:06,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {2272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2276#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:06,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2276#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2280#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:06,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2284#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:06,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:06,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {2288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:06,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {2292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2296#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:06,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {2296#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {2236#false} is VALID [2022-04-08 10:21:06,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {2236#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2236#false} is VALID [2022-04-08 10:21:06,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} ~cond := #in~cond; {2236#false} is VALID [2022-04-08 10:21:06,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} assume 0 == ~cond; {2236#false} is VALID [2022-04-08 10:21:06,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-04-08 10:21:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:06,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:06,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-04-08 10:21:06,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} assume 0 == ~cond; {2236#false} is VALID [2022-04-08 10:21:06,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} ~cond := #in~cond; {2236#false} is VALID [2022-04-08 10:21:06,568 INFO L272 TraceCheckUtils]: 17: Hoare triple {2236#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2236#false} is VALID [2022-04-08 10:21:06,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {2324#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2236#false} is VALID [2022-04-08 10:21:06,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {2328#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2324#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:06,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {2332#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2328#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:06,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {2336#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2332#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:06,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {2340#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2336#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:06,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2344#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2340#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:06,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {2348#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2344#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:06,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {2352#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2348#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:06,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {2356#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2352#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:06,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2360#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2356#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:06,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {2364#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2360#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:06,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {2368#(< 10 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2364#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:06,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {2368#(< 10 ~SIZE~0)} call #t~ret4 := main(); {2368#(< 10 ~SIZE~0)} is VALID [2022-04-08 10:21:06,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2368#(< 10 ~SIZE~0)} {2235#true} #45#return; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-08 10:21:06,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {2368#(< 10 ~SIZE~0)} assume true; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-08 10:21:06,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2368#(< 10 ~SIZE~0)} is VALID [2022-04-08 10:21:06,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {2235#true} call ULTIMATE.init(); {2235#true} is VALID [2022-04-08 10:21:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535296098] [2022-04-08 10:21:06,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875586962] [2022-04-08 10:21:06,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875586962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:06,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:06,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 10:21:06,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331631533] [2022-04-08 10:21:06,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331631533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:06,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:06,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:21:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816435091] [2022-04-08 10:21:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-08 10:21:06,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:06,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-04-08 10:21:06,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:06,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:21:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:21:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:21:06,596 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-04-08 10:21:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:08,688 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:21:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:21:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-08 10:21:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-04-08 10:21:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 10:21:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-04-08 10:21:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 10:21:08,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-08 10:21:08,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:08,714 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:21:08,715 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:21:08,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:21:08,715 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:08,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:21:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:21:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:21:08,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:08,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-04-08 10:21:08,731 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-04-08 10:21:08,731 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-04-08 10:21:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:08,732 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:21:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:21:08,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:08,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:08,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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) Second operand 23 states. [2022-04-08 10:21:08,733 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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) Second operand 23 states. [2022-04-08 10:21:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:08,733 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:21:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:21:08,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:08,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:08,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:08,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-04-08 10:21:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-08 10:21:08,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-08 10:21:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:08,735 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-08 10:21:08,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-04-08 10:21:08,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-08 10:21:08,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:21:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:21:08,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:08,756 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:08,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:08,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:21:08,956 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash 617388978, now seen corresponding path program 21 times [2022-04-08 10:21:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:08,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331861034] [2022-04-08 10:21:08,959 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:08,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 617388978, now seen corresponding path program 22 times [2022-04-08 10:21:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916338335] [2022-04-08 10:21:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:09,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:09,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641818535] [2022-04-08 10:21:09,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:21:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:09,011 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:09,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:21:09,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:21:09,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:09,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:21:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:09,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:09,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {2534#true} call ULTIMATE.init(); {2534#true} is VALID [2022-04-08 10:21:09,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:09,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2542#(<= 40000 ~SIZE~0)} assume true; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:09,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2542#(<= 40000 ~SIZE~0)} {2534#true} #45#return; {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:09,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {2542#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2542#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:09,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2542#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:09,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:09,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {2559#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:09,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:09,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:09,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {2571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2575#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:09,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {2575#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:09,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {2579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2583#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:09,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {2583#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:09,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {2587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:09,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {2591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2595#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:09,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {2595#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2599#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:09,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {2599#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !(~i~0 < ~SIZE~0); {2535#false} is VALID [2022-04-08 10:21:09,364 INFO L272 TraceCheckUtils]: 18: Hoare triple {2535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2535#false} is VALID [2022-04-08 10:21:09,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {2535#false} ~cond := #in~cond; {2535#false} is VALID [2022-04-08 10:21:09,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {2535#false} assume 0 == ~cond; {2535#false} is VALID [2022-04-08 10:21:09,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#false} assume !false; {2535#false} is VALID [2022-04-08 10:21:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:09,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:09,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#false} assume !false; {2535#false} is VALID [2022-04-08 10:21:09,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {2535#false} assume 0 == ~cond; {2535#false} is VALID [2022-04-08 10:21:09,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {2535#false} ~cond := #in~cond; {2535#false} is VALID [2022-04-08 10:21:09,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {2535#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2535#false} is VALID [2022-04-08 10:21:09,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {2627#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2535#false} is VALID [2022-04-08 10:21:09,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {2631#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2627#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:09,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2631#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:09,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2635#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:09,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {2643#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2639#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:09,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {2647#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2643#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:09,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2647#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:09,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {2655#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2651#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:09,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2655#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:09,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {2663#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2659#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:09,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {2667#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2663#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:09,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2671#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2667#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:09,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {2675#(< 11 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2671#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:09,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2675#(< 11 ~SIZE~0)} call #t~ret4 := main(); {2675#(< 11 ~SIZE~0)} is VALID [2022-04-08 10:21:09,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2675#(< 11 ~SIZE~0)} {2534#true} #45#return; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-08 10:21:09,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2675#(< 11 ~SIZE~0)} assume true; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-08 10:21:09,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {2534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2675#(< 11 ~SIZE~0)} is VALID [2022-04-08 10:21:09,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {2534#true} call ULTIMATE.init(); {2534#true} is VALID [2022-04-08 10:21:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:09,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916338335] [2022-04-08 10:21:09,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641818535] [2022-04-08 10:21:09,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641818535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:09,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:09,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 10:21:09,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331861034] [2022-04-08 10:21:09,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331861034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:09,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:09,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:21:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40648516] [2022-04-08 10:21:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-08 10:21:09,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:09,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-04-08 10:21:09,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:09,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:21:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:21:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:21:09,789 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-04-08 10:21:15,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:21:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:15,125 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:21:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:21:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-08 10:21:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-04-08 10:21:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-08 10:21:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-04-08 10:21:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-08 10:21:15,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-08 10:21:15,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:15,155 INFO L225 Difference]: With dead ends: 29 [2022-04-08 10:21:15,155 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:21:15,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:21:15,156 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:15,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:21:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:21:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 10:21:15,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:15,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-04-08 10:21:15,174 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-04-08 10:21:15,174 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-04-08 10:21:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:15,174 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:21:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:21:15,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:15,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:15,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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) Second operand 24 states. [2022-04-08 10:21:15,175 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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) Second operand 24 states. [2022-04-08 10:21:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:15,175 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:21:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:21:15,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:15,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:15,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:15,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-04-08 10:21:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 10:21:15,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-08 10:21:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:15,176 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 10:21:15,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-04-08 10:21:15,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 10:21:15,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:21:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:21:15,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:15,193 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:15,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:15,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:21:15,394 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1993684203, now seen corresponding path program 23 times [2022-04-08 10:21:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:15,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690092460] [2022-04-08 10:21:15,397 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:15,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1993684203, now seen corresponding path program 24 times [2022-04-08 10:21:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:15,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290703020] [2022-04-08 10:21:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:15,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356889562] [2022-04-08 10:21:15,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:21:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:15,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 10:21:15,450 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:21:15,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:15,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:21:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:15,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:15,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 10:21:15,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:15,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#(<= 40000 ~SIZE~0)} assume true; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:15,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#(<= 40000 ~SIZE~0)} {2847#true} #45#return; {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:15,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2855#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:15,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2868#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:15,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {2868#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2872#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:15,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:15,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {2876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:15,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {2880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:15,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2888#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:15,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:15,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {2892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2896#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:15,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {2896#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:15,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:15,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2908#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:15,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {2908#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:15,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:21:15,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {2916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !(~i~0 < ~SIZE~0); {2848#false} is VALID [2022-04-08 10:21:15,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {2848#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2848#false} is VALID [2022-04-08 10:21:15,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 10:21:15,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 10:21:15,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 10:21:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:15,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:16,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 10:21:16,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 10:21:16,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 10:21:16,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {2848#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2848#false} is VALID [2022-04-08 10:21:16,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2848#false} is VALID [2022-04-08 10:21:16,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {2948#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2944#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:16,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {2952#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2948#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:16,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {2956#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2952#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:16,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2960#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2956#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:16,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2960#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:16,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {2968#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2964#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:16,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {2972#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2968#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:16,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {2976#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2972#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:16,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {2980#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2976#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:16,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {2984#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2980#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:16,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {2988#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2984#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:16,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {2992#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {2988#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:16,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {2996#(< 12 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2992#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:21:16,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#(< 12 ~SIZE~0)} call #t~ret4 := main(); {2996#(< 12 ~SIZE~0)} is VALID [2022-04-08 10:21:16,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#(< 12 ~SIZE~0)} {2847#true} #45#return; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-08 10:21:16,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#(< 12 ~SIZE~0)} assume true; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-08 10:21:16,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {2996#(< 12 ~SIZE~0)} is VALID [2022-04-08 10:21:16,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 10:21:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:16,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290703020] [2022-04-08 10:21:16,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:16,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356889562] [2022-04-08 10:21:16,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356889562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:16,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:16,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 10:21:16,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690092460] [2022-04-08 10:21:16,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690092460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:16,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:16,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:21:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397953981] [2022-04-08 10:21:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-08 10:21:16,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:16,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-04-08 10:21:16,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:16,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:21:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:21:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:21:16,254 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-04-08 10:21:20,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:21:22,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:21:24,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:21:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:26,480 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:21:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:21:26,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-08 10:21:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-04-08 10:21:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-08 10:21:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-04-08 10:21:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-08 10:21:26,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-08 10:21:26,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:26,512 INFO L225 Difference]: With dead ends: 30 [2022-04-08 10:21:26,512 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 10:21:26,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:21:26,513 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:26,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-08 10:21:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 10:21:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 10:21:26,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:26,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-04-08 10:21:26,531 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-04-08 10:21:26,531 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-04-08 10:21:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:26,531 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:21:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:21:26,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:26,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:26,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) Second operand 25 states. [2022-04-08 10:21:26,532 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) Second operand 25 states. [2022-04-08 10:21:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:26,532 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:21:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:21:26,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:26,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:26,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:26,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-04-08 10:21:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 10:21:26,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-08 10:21:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:26,533 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 10:21:26,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-04-08 10:21:26,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 10:21:26,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:21:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:21:26,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:26,553 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:26,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:26,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:21:26,754 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1709163218, now seen corresponding path program 25 times [2022-04-08 10:21:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:26,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118802514] [2022-04-08 10:21:26,757 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:26,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1709163218, now seen corresponding path program 26 times [2022-04-08 10:21:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:26,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005545907] [2022-04-08 10:21:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:26,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:26,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544141543] [2022-04-08 10:21:26,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:21:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:26,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:26,769 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:26,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 10:21:26,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:21:26,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:26,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:21:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:26,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:27,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {3174#true} call ULTIMATE.init(); {3174#true} is VALID [2022-04-08 10:21:27,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {3174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:27,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#(<= 40000 ~SIZE~0)} assume true; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:27,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#(<= 40000 ~SIZE~0)} {3174#true} #45#return; {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:27,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3182#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:27,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {3195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3203#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:27,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:27,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:27,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3215#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {3215#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:27,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3223#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {3223#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:27,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:27,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {3231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3235#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3239#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:27,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:21:27,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {3243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3247#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:27,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3175#false} is VALID [2022-04-08 10:21:27,151 INFO L272 TraceCheckUtils]: 20: Hoare triple {3175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3175#false} is VALID [2022-04-08 10:21:27,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#false} ~cond := #in~cond; {3175#false} is VALID [2022-04-08 10:21:27,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#false} assume 0 == ~cond; {3175#false} is VALID [2022-04-08 10:21:27,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#false} assume !false; {3175#false} is VALID [2022-04-08 10:21:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:27,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:27,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#false} assume !false; {3175#false} is VALID [2022-04-08 10:21:27,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#false} assume 0 == ~cond; {3175#false} is VALID [2022-04-08 10:21:27,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#false} ~cond := #in~cond; {3175#false} is VALID [2022-04-08 10:21:27,570 INFO L272 TraceCheckUtils]: 20: Hoare triple {3175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3175#false} is VALID [2022-04-08 10:21:27,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {3275#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3175#false} is VALID [2022-04-08 10:21:27,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {3279#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3275#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:27,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {3283#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3279#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:27,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {3287#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3283#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:27,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3287#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:27,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3291#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:27,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {3299#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3295#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:27,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3299#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:27,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {3307#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3303#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:27,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {3311#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3307#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:27,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {3315#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3311#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:27,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3315#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:27,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {3323#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3319#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:27,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {3327#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3323#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:21:27,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {3331#(< 13 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3327#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:21:27,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {3331#(< 13 ~SIZE~0)} call #t~ret4 := main(); {3331#(< 13 ~SIZE~0)} is VALID [2022-04-08 10:21:27,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3331#(< 13 ~SIZE~0)} {3174#true} #45#return; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-08 10:21:27,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {3331#(< 13 ~SIZE~0)} assume true; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-08 10:21:27,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {3174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3331#(< 13 ~SIZE~0)} is VALID [2022-04-08 10:21:27,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {3174#true} call ULTIMATE.init(); {3174#true} is VALID [2022-04-08 10:21:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005545907] [2022-04-08 10:21:27,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544141543] [2022-04-08 10:21:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544141543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:27,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 10:21:27,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118802514] [2022-04-08 10:21:27,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118802514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:27,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:21:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056144988] [2022-04-08 10:21:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) 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) Word has length 24 [2022-04-08 10:21:27,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:27,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) 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-04-08 10:21:27,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:27,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:21:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:27,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:21:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:21:27,608 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) 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-04-08 10:21:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:34,568 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:21:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:21:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) 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) Word has length 24 [2022-04-08 10:21:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) 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-04-08 10:21:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-08 10:21:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) 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-04-08 10:21:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-08 10:21:34,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-08 10:21:34,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:34,590 INFO L225 Difference]: With dead ends: 31 [2022-04-08 10:21:34,590 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:21:34,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:21:34,591 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:34,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:21:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:21:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 10:21:34,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:34,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-04-08 10:21:34,611 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-04-08 10:21:34,611 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-04-08 10:21:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:34,611 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:21:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:21:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:34,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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) Second operand 26 states. [2022-04-08 10:21:34,612 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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) Second operand 26 states. [2022-04-08 10:21:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:34,612 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:21:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:21:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:34,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:34,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:34,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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-04-08 10:21:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-08 10:21:34,613 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-08 10:21:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:34,613 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-08 10:21:34,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) 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-04-08 10:21:34,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-08 10:21:34,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:21:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:21:34,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:34,631 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:34,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:34,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:34,843 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1478947275, now seen corresponding path program 27 times [2022-04-08 10:21:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954779346] [2022-04-08 10:21:34,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:34,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1478947275, now seen corresponding path program 28 times [2022-04-08 10:21:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079381390] [2022-04-08 10:21:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:34,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:34,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452513799] [2022-04-08 10:21:34,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:21:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:34,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:34,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 10:21:34,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:21:34,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:34,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:21:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:34,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:35,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2022-04-08 10:21:35,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:35,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {3523#(<= 40000 ~SIZE~0)} assume true; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:35,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3523#(<= 40000 ~SIZE~0)} {3515#true} #45#return; {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:35,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {3523#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3523#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:35,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {3523#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3536#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {3536#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3540#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {3540#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3544#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:35,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {3544#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:35,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {3548#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:35,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {3552#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3556#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {3556#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:35,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {3560#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3564#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {3564#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3568#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:35,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:35,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {3572#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3576#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3580#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:35,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {3580#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3584#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:21:35,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3588#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {3588#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3592#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:35,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {3592#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3516#false} is VALID [2022-04-08 10:21:35,271 INFO L272 TraceCheckUtils]: 21: Hoare triple {3516#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3516#false} is VALID [2022-04-08 10:21:35,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2022-04-08 10:21:35,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {3516#false} assume 0 == ~cond; {3516#false} is VALID [2022-04-08 10:21:35,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2022-04-08 10:21:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:35,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:35,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2022-04-08 10:21:35,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {3516#false} assume 0 == ~cond; {3516#false} is VALID [2022-04-08 10:21:35,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2022-04-08 10:21:35,710 INFO L272 TraceCheckUtils]: 21: Hoare triple {3516#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3516#false} is VALID [2022-04-08 10:21:35,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3620#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3516#false} is VALID [2022-04-08 10:21:35,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3620#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:35,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {3628#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3624#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:35,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {3632#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3628#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:35,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {3636#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3632#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:35,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {3640#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3636#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:35,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {3644#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3640#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:35,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {3648#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3644#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:35,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {3652#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3648#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:35,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {3656#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3652#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:35,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {3660#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3656#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:35,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {3664#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3660#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:35,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {3668#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3664#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:35,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {3672#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3668#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:21:35,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {3676#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3672#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:21:35,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {3680#(< 14 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3676#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:21:35,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {3680#(< 14 ~SIZE~0)} call #t~ret4 := main(); {3680#(< 14 ~SIZE~0)} is VALID [2022-04-08 10:21:35,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3680#(< 14 ~SIZE~0)} {3515#true} #45#return; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-08 10:21:35,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {3680#(< 14 ~SIZE~0)} assume true; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-08 10:21:35,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3680#(< 14 ~SIZE~0)} is VALID [2022-04-08 10:21:35,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2022-04-08 10:21:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079381390] [2022-04-08 10:21:35,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452513799] [2022-04-08 10:21:35,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452513799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:35,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:35,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 10:21:35,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954779346] [2022-04-08 10:21:35,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954779346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:35,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:35,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:21:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486569176] [2022-04-08 10:21:35,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-08 10:21:35,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:35,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04-08 10:21:35,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:35,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:21:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:21:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:21:35,740 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04-08 10:21:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:38,028 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:21:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:21:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-08 10:21:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04-08 10:21:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 10:21:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04-08 10:21:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 10:21:38,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-08 10:21:38,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:38,049 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:21:38,049 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:21:38,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:21:38,050 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:38,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:21:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:21:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 10:21:38,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:38,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-04-08 10:21:38,068 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-04-08 10:21:38,068 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-04-08 10:21:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:38,068 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:21:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:21:38,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:38,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:38,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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) Second operand 27 states. [2022-04-08 10:21:38,069 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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) Second operand 27 states. [2022-04-08 10:21:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:38,069 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:21:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:21:38,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:38,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:38,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:38,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-04-08 10:21:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 10:21:38,070 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-08 10:21:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:38,070 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 10:21:38,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04-08 10:21:38,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 10:21:38,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:21:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:21:38,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:38,089 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:38,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 10:21:38,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 10:21:38,290 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1362779662, now seen corresponding path program 29 times [2022-04-08 10:21:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:38,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618939706] [2022-04-08 10:21:38,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:38,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1362779662, now seen corresponding path program 30 times [2022-04-08 10:21:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611234284] [2022-04-08 10:21:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:38,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507899946] [2022-04-08 10:21:38,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:21:38,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:38,306 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:38,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 10:21:38,350 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:21:38,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:38,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:21:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:38,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:38,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2022-04-08 10:21:38,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {3870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:38,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3878#(<= 40000 ~SIZE~0)} assume true; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:38,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3878#(<= 40000 ~SIZE~0)} {3870#true} #45#return; {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:38,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {3878#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3878#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:38,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {3878#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3891#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {3891#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3895#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {3895#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3899#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:38,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {3899#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3903#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:38,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {3903#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3907#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:38,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {3907#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3911#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3915#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:38,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {3915#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3919#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {3919#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3923#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:38,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {3923#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3927#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:38,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {3927#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3931#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3931#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3935#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:38,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {3935#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:21:38,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {3939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3943#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {3943#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3947#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {3947#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3951#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:38,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {3951#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {3871#false} is VALID [2022-04-08 10:21:38,755 INFO L272 TraceCheckUtils]: 22: Hoare triple {3871#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3871#false} is VALID [2022-04-08 10:21:38,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#false} ~cond := #in~cond; {3871#false} is VALID [2022-04-08 10:21:38,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#false} assume 0 == ~cond; {3871#false} is VALID [2022-04-08 10:21:38,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2022-04-08 10:21:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:38,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:39,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2022-04-08 10:21:39,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {3871#false} assume 0 == ~cond; {3871#false} is VALID [2022-04-08 10:21:39,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {3871#false} ~cond := #in~cond; {3871#false} is VALID [2022-04-08 10:21:39,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {3871#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3871#false} is VALID [2022-04-08 10:21:39,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {3979#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {3871#false} is VALID [2022-04-08 10:21:39,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {3983#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3979#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:39,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {3987#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3983#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:39,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {3991#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3987#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:39,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {3995#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3991#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:39,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {3999#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3995#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:39,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {4003#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {3999#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:39,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {4007#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4003#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:39,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {4011#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4007#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:39,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {4015#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4011#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:39,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {4019#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4015#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:39,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {4023#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4019#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:39,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {4027#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4023#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:39,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {4031#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4027#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:21:39,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {4035#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4031#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:21:39,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {4039#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4035#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:21:39,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {4043#(< 15 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4039#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:21:39,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {4043#(< 15 ~SIZE~0)} call #t~ret4 := main(); {4043#(< 15 ~SIZE~0)} is VALID [2022-04-08 10:21:39,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4043#(< 15 ~SIZE~0)} {3870#true} #45#return; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-08 10:21:39,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {4043#(< 15 ~SIZE~0)} assume true; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-08 10:21:39,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4043#(< 15 ~SIZE~0)} is VALID [2022-04-08 10:21:39,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2022-04-08 10:21:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611234284] [2022-04-08 10:21:39,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507899946] [2022-04-08 10:21:39,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507899946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:39,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 10:21:39,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618939706] [2022-04-08 10:21:39,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618939706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:39,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:21:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782958500] [2022-04-08 10:21:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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) Word has length 26 [2022-04-08 10:21:39,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:39,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-04-08 10:21:39,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:39,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:21:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:21:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:21:39,271 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-04-08 10:21:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:47,653 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:21:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:21:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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) Word has length 26 [2022-04-08 10:21:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:21:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-04-08 10:21:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-08 10:21:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-04-08 10:21:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-08 10:21:47,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-08 10:21:47,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:47,677 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:21:47,677 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:21:47,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:21:47,678 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:21:47,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:21:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:21:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 10:21:47,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:21:47,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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-04-08 10:21:47,699 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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-04-08 10:21:47,699 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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-04-08 10:21:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:47,700 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:21:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:21:47,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:47,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:47,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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) Second operand 28 states. [2022-04-08 10:21:47,700 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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) Second operand 28 states. [2022-04-08 10:21:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:21:47,701 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:21:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:21:47,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:21:47,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:21:47,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:21:47,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:21:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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-04-08 10:21:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-08 10:21:47,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-08 10:21:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:21:47,702 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-08 10:21:47,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-04-08 10:21:47,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-08 10:21:47,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:21:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:21:47,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:21:47,722 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:21:47,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 10:21:47,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:21:47,922 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:21:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:21:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 737998507, now seen corresponding path program 31 times [2022-04-08 10:21:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:47,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532364286] [2022-04-08 10:21:47,925 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:21:47,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:21:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 737998507, now seen corresponding path program 32 times [2022-04-08 10:21:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:21:47,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787111116] [2022-04-08 10:21:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:21:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:21:47,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:21:47,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564596275] [2022-04-08 10:21:47,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:21:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:21:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:21:47,948 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:21:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 10:21:47,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:21:47,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:21:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:21:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:21:47,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:21:48,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {4239#true} call ULTIMATE.init(); {4239#true} is VALID [2022-04-08 10:21:48,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {4239#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:48,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#(<= 40000 ~SIZE~0)} assume true; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:48,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#(<= 40000 ~SIZE~0)} {4239#true} #45#return; {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:48,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4247#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:21:48,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {4260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4264#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {4264#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:21:48,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {4268#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:21:48,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {4272#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4276#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:21:48,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {4276#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4280#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {4280#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:21:48,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {4284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4288#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:21:48,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {4292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4296#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:21:48,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {4296#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4300#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {4300#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:21:48,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {4304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:21:48,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {4308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4312#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {4312#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4316#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {4316#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4320#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4324#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:21:48,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {4324#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {4240#false} is VALID [2022-04-08 10:21:48,401 INFO L272 TraceCheckUtils]: 23: Hoare triple {4240#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4240#false} is VALID [2022-04-08 10:21:48,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#false} ~cond := #in~cond; {4240#false} is VALID [2022-04-08 10:21:48,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#false} assume 0 == ~cond; {4240#false} is VALID [2022-04-08 10:21:48,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {4240#false} assume !false; {4240#false} is VALID [2022-04-08 10:21:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:48,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:21:48,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {4240#false} assume !false; {4240#false} is VALID [2022-04-08 10:21:48,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {4240#false} assume 0 == ~cond; {4240#false} is VALID [2022-04-08 10:21:48,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {4240#false} ~cond := #in~cond; {4240#false} is VALID [2022-04-08 10:21:48,932 INFO L272 TraceCheckUtils]: 23: Hoare triple {4240#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4240#false} is VALID [2022-04-08 10:21:48,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {4352#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {4240#false} is VALID [2022-04-08 10:21:48,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {4356#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4352#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:21:48,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {4360#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4356#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:21:48,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4360#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:21:48,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {4368#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4364#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:21:48,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4368#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:21:48,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4372#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:48,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {4380#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4376#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:21:48,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {4384#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4380#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:21:48,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {4388#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4384#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:21:48,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {4392#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4388#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:21:48,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {4396#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4392#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:21:48,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {4400#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4396#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:21:48,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {4404#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4400#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:21:48,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {4408#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4404#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:21:48,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {4412#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4408#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:21:48,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {4416#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4412#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:21:48,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {4420#(< 16 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4416#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:21:48,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {4420#(< 16 ~SIZE~0)} call #t~ret4 := main(); {4420#(< 16 ~SIZE~0)} is VALID [2022-04-08 10:21:48,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4420#(< 16 ~SIZE~0)} {4239#true} #45#return; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-08 10:21:48,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {4420#(< 16 ~SIZE~0)} assume true; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-08 10:21:48,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {4239#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4420#(< 16 ~SIZE~0)} is VALID [2022-04-08 10:21:48,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {4239#true} call ULTIMATE.init(); {4239#true} is VALID [2022-04-08 10:21:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:21:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:21:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787111116] [2022-04-08 10:21:48,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:21:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564596275] [2022-04-08 10:21:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564596275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:21:48,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:21:48,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 10:21:48,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:21:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532364286] [2022-04-08 10:21:48,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532364286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:21:48,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:21:48,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:21:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378428278] [2022-04-08 10:21:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:21:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-08 10:21:48,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:21:48,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-04-08 10:21:48,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:21:48,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:21:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:21:48,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:21:48,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:21:48,963 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-04-08 10:21:59,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:22:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:01,409 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:22:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:22:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-08 10:22:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-04-08 10:22:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 10:22:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-04-08 10:22:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 10:22:01,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-08 10:22:01,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:01,434 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:22:01,434 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:22:01,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:22:01,435 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:01,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:22:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:22:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 10:22:01,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:01,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-04-08 10:22:01,453 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-04-08 10:22:01,453 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-04-08 10:22:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:01,454 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:22:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:22:01,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:01,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:01,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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) Second operand 29 states. [2022-04-08 10:22:01,454 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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) Second operand 29 states. [2022-04-08 10:22:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:01,454 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:22:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:22:01,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:01,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:01,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:01,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-04-08 10:22:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-08 10:22:01,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-08 10:22:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:01,455 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-08 10:22:01,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-04-08 10:22:01,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-08 10:22:01,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:22:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:22:01,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:01,483 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:01,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:01,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:22:01,692 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1437612306, now seen corresponding path program 33 times [2022-04-08 10:22:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:01,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447909448] [2022-04-08 10:22:01,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:01,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1437612306, now seen corresponding path program 34 times [2022-04-08 10:22:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:01,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693891576] [2022-04-08 10:22:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:01,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:01,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396760364] [2022-04-08 10:22:01,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:22:01,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:01,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:01,713 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:01,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 10:22:01,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:22:01,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:01,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 10:22:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:02,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} call ULTIMATE.init(); {4622#true} is VALID [2022-04-08 10:22:02,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:02,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {4630#(<= 40000 ~SIZE~0)} assume true; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:02,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4630#(<= 40000 ~SIZE~0)} {4622#true} #45#return; {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:02,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {4630#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:02,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {4630#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {4647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:02,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:02,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {4655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:02,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {4659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {4663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:02,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {4667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {4671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:02,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {4675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:02,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {4679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {4683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:02,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {4687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:02,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {4691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {4695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {4699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {4703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:02,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {4707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:02,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {4711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !(~i~0 < ~SIZE~0); {4623#false} is VALID [2022-04-08 10:22:02,225 INFO L272 TraceCheckUtils]: 24: Hoare triple {4623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4623#false} is VALID [2022-04-08 10:22:02,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#false} ~cond := #in~cond; {4623#false} is VALID [2022-04-08 10:22:02,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {4623#false} assume 0 == ~cond; {4623#false} is VALID [2022-04-08 10:22:02,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-04-08 10:22:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:02,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:02,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-04-08 10:22:02,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {4623#false} assume 0 == ~cond; {4623#false} is VALID [2022-04-08 10:22:02,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {4623#false} ~cond := #in~cond; {4623#false} is VALID [2022-04-08 10:22:02,863 INFO L272 TraceCheckUtils]: 24: Hoare triple {4623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4623#false} is VALID [2022-04-08 10:22:02,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {4739#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {4623#false} is VALID [2022-04-08 10:22:02,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {4743#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4739#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:02,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4743#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:02,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4747#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:02,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4751#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:02,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {4759#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4755#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:02,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {4763#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4759#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:02,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4763#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:02,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {4771#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4767#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:02,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4771#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:02,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4775#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:02,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {4783#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4779#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:02,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {4787#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4783#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:02,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {4791#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4787#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:02,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4791#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:02,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {4799#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4795#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:02,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {4803#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4799#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:02,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {4807#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {4803#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:02,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {4811#(< 17 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4807#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:02,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4811#(< 17 ~SIZE~0)} call #t~ret4 := main(); {4811#(< 17 ~SIZE~0)} is VALID [2022-04-08 10:22:02,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4811#(< 17 ~SIZE~0)} {4622#true} #45#return; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-08 10:22:02,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {4811#(< 17 ~SIZE~0)} assume true; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-08 10:22:02,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {4811#(< 17 ~SIZE~0)} is VALID [2022-04-08 10:22:02,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} call ULTIMATE.init(); {4622#true} is VALID [2022-04-08 10:22:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:02,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:02,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693891576] [2022-04-08 10:22:02,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:02,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396760364] [2022-04-08 10:22:02,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396760364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:02,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:02,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 10:22:02,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447909448] [2022-04-08 10:22:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447909448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:02,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:02,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:22:02,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953858982] [2022-04-08 10:22:02,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-08 10:22:02,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:02,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-04-08 10:22:02,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:02,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:22:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:22:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:22:02,894 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-04-08 10:22:05,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:22:07,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:22:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:07,268 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:22:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:22:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-08 10:22:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-04-08 10:22:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-08 10:22:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-04-08 10:22:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-08 10:22:07,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-08 10:22:07,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:07,297 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:22:07,297 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 10:22:07,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:22:07,298 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:07,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:22:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 10:22:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 10:22:07,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:07,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-04-08 10:22:07,322 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-04-08 10:22:07,322 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-04-08 10:22:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:07,323 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:22:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:22:07,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:07,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:07,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) Second operand 30 states. [2022-04-08 10:22:07,323 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) Second operand 30 states. [2022-04-08 10:22:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:07,324 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:22:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:22:07,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:07,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:07,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:07,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-04-08 10:22:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-08 10:22:07,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-08 10:22:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:07,325 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-08 10:22:07,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-04-08 10:22:07,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-08 10:22:07,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:22:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:22:07,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:07,344 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:07,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:07,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:22:07,560 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1650803595, now seen corresponding path program 35 times [2022-04-08 10:22:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:07,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179857994] [2022-04-08 10:22:07,563 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:07,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1650803595, now seen corresponding path program 36 times [2022-04-08 10:22:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:07,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976957450] [2022-04-08 10:22:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:07,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:07,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:07,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420471798] [2022-04-08 10:22:07,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:22:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:07,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:07,585 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:07,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 10:22:07,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:22:07,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:07,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:22:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:07,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:08,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {5019#true} call ULTIMATE.init(); {5019#true} is VALID [2022-04-08 10:22:08,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:08,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5027#(<= 40000 ~SIZE~0)} assume true; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:08,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5027#(<= 40000 ~SIZE~0)} {5019#true} #45#return; {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:08,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {5027#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5027#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:08,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {5027#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5040#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5044#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {5044#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5048#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:08,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {5048#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:08,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {5052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:08,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {5056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5060#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {5060#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:08,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {5064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5068#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {5068#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5072#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:08,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {5072#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:08,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {5076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5080#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:08,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {5084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5088#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:08,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {5088#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5092#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {5092#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5096#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5096#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5100#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {5100#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5104#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5104#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5108#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:08,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {5108#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5112#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:08,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {5112#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {5020#false} is VALID [2022-04-08 10:22:08,155 INFO L272 TraceCheckUtils]: 25: Hoare triple {5020#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5020#false} is VALID [2022-04-08 10:22:08,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {5020#false} ~cond := #in~cond; {5020#false} is VALID [2022-04-08 10:22:08,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {5020#false} assume 0 == ~cond; {5020#false} is VALID [2022-04-08 10:22:08,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {5020#false} assume !false; {5020#false} is VALID [2022-04-08 10:22:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:08,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:08,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {5020#false} assume !false; {5020#false} is VALID [2022-04-08 10:22:08,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {5020#false} assume 0 == ~cond; {5020#false} is VALID [2022-04-08 10:22:08,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {5020#false} ~cond := #in~cond; {5020#false} is VALID [2022-04-08 10:22:08,850 INFO L272 TraceCheckUtils]: 25: Hoare triple {5020#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5020#false} is VALID [2022-04-08 10:22:08,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {5140#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5020#false} is VALID [2022-04-08 10:22:08,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {5144#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5140#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:08,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {5148#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5144#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:08,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {5152#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5148#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:08,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {5156#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5152#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:08,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {5160#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5156#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:08,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {5164#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5160#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:08,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {5168#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5164#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:08,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {5172#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5168#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:08,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {5176#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5172#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:08,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {5180#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5176#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:08,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {5184#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5180#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:08,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {5188#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5184#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:08,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {5192#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5188#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:08,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {5196#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5192#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:08,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {5200#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5196#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:08,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5200#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:08,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {5208#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5204#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:08,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {5212#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5208#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:08,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {5216#(< 18 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5212#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:08,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {5216#(< 18 ~SIZE~0)} call #t~ret4 := main(); {5216#(< 18 ~SIZE~0)} is VALID [2022-04-08 10:22:08,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5216#(< 18 ~SIZE~0)} {5019#true} #45#return; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-08 10:22:08,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {5216#(< 18 ~SIZE~0)} assume true; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-08 10:22:08,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5216#(< 18 ~SIZE~0)} is VALID [2022-04-08 10:22:08,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {5019#true} call ULTIMATE.init(); {5019#true} is VALID [2022-04-08 10:22:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:08,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976957450] [2022-04-08 10:22:08,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:08,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420471798] [2022-04-08 10:22:08,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420471798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:08,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:08,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 10:22:08,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179857994] [2022-04-08 10:22:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179857994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:08,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:08,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:22:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383602581] [2022-04-08 10:22:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-08 10:22:08,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:08,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-04-08 10:22:08,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:08,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:22:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:22:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:22:08,886 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-04-08 10:22:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:10,978 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:22:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:22:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-08 10:22:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-04-08 10:22:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 10:22:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-04-08 10:22:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 10:22:10,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-08 10:22:11,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:11,009 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:22:11,009 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 10:22:11,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:22:11,010 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:11,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:22:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 10:22:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 10:22:11,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:11,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-04-08 10:22:11,030 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-04-08 10:22:11,030 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-04-08 10:22:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:11,031 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:22:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:22:11,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:11,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:11,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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) Second operand 31 states. [2022-04-08 10:22:11,031 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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) Second operand 31 states. [2022-04-08 10:22:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:11,032 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:22:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:22:11,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:11,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:11,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:11,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-04-08 10:22:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 10:22:11,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-08 10:22:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:11,033 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 10:22:11,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-04-08 10:22:11,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 10:22:11,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:22:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:22:11,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:11,059 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:11,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 10:22:11,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:11,259 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -330201038, now seen corresponding path program 37 times [2022-04-08 10:22:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:11,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769694347] [2022-04-08 10:22:11,265 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:11,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash -330201038, now seen corresponding path program 38 times [2022-04-08 10:22:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:11,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586496298] [2022-04-08 10:22:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:11,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778561932] [2022-04-08 10:22:11,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:22:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:11,288 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:11,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 10:22:11,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:22:11,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:11,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:22:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:11,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:11,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2022-04-08 10:22:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:11,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {5438#(<= 40000 ~SIZE~0)} assume true; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:11,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5438#(<= 40000 ~SIZE~0)} {5430#true} #45#return; {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:11,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {5438#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5438#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:11,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {5438#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5451#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {5451#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5455#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {5455#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:11,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {5459#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:11,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {5463#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:11,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5471#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {5471#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:11,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {5475#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5479#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {5479#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:11,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {5483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:11,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {5487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5491#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {5491#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5495#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:11,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {5495#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:11,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5503#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {5503#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5507#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {5507#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5511#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {5511#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5515#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {5515#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:11,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5523#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:11,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {5523#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:11,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {5527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !(~i~0 < ~SIZE~0); {5431#false} is VALID [2022-04-08 10:22:11,854 INFO L272 TraceCheckUtils]: 26: Hoare triple {5431#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5431#false} is VALID [2022-04-08 10:22:11,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~cond := #in~cond; {5431#false} is VALID [2022-04-08 10:22:11,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume 0 == ~cond; {5431#false} is VALID [2022-04-08 10:22:11,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-08 10:22:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:11,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:12,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-08 10:22:12,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume 0 == ~cond; {5431#false} is VALID [2022-04-08 10:22:12,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~cond := #in~cond; {5431#false} is VALID [2022-04-08 10:22:12,652 INFO L272 TraceCheckUtils]: 26: Hoare triple {5431#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5431#false} is VALID [2022-04-08 10:22:12,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {5555#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5431#false} is VALID [2022-04-08 10:22:12,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {5559#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5555#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:12,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {5563#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5559#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:12,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {5567#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5563#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:12,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5567#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:12,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {5575#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5571#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:12,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {5579#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5575#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:12,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {5583#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5579#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:12,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5583#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:12,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {5591#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5587#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:12,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {5595#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5591#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:12,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5595#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:12,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5599#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:12,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {5607#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5603#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:12,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {5611#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5607#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:12,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {5615#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5611#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:12,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {5619#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5615#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:12,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {5623#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5619#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:12,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {5627#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5623#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:12,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {5631#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5627#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:12,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {5635#(< 19 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5631#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:12,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {5635#(< 19 ~SIZE~0)} call #t~ret4 := main(); {5635#(< 19 ~SIZE~0)} is VALID [2022-04-08 10:22:12,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5635#(< 19 ~SIZE~0)} {5430#true} #45#return; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-08 10:22:12,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {5635#(< 19 ~SIZE~0)} assume true; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-08 10:22:12,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5635#(< 19 ~SIZE~0)} is VALID [2022-04-08 10:22:12,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2022-04-08 10:22:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:12,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586496298] [2022-04-08 10:22:12,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:12,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778561932] [2022-04-08 10:22:12,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778561932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:12,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-08 10:22:12,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:12,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769694347] [2022-04-08 10:22:12,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769694347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:12,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:12,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:22:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500302157] [2022-04-08 10:22:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-08 10:22:12,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:12,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-04-08 10:22:12,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:12,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:22:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:22:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:22:12,692 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-04-08 10:22:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:17,452 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:22:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:22:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-08 10:22:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-04-08 10:22:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-08 10:22:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-04-08 10:22:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-08 10:22:17,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-08 10:22:17,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:17,477 INFO L225 Difference]: With dead ends: 37 [2022-04-08 10:22:17,477 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:22:17,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:22:17,478 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:17,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:22:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:22:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:22:17,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:17,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-04-08 10:22:17,499 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-04-08 10:22:17,499 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-04-08 10:22:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:17,499 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:22:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:22:17,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:17,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:17,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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) Second operand 32 states. [2022-04-08 10:22:17,500 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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) Second operand 32 states. [2022-04-08 10:22:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:17,500 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:22:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:22:17,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:17,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:17,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:17,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-04-08 10:22:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-08 10:22:17,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-08 10:22:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:17,501 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-08 10:22:17,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-04-08 10:22:17,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-08 10:22:17,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:22:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:22:17,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:17,522 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:17,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 10:22:17,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:17,722 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1611802517, now seen corresponding path program 39 times [2022-04-08 10:22:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:17,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1348824068] [2022-04-08 10:22:17,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:17,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1611802517, now seen corresponding path program 40 times [2022-04-08 10:22:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:17,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144431141] [2022-04-08 10:22:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:17,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622428837] [2022-04-08 10:22:17,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:22:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:17,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:17,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 10:22:17,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:22:17,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:17,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:22:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:17,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:18,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {5855#true} call ULTIMATE.init(); {5855#true} is VALID [2022-04-08 10:22:18,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {5855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:18,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {5863#(<= 40000 ~SIZE~0)} assume true; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:18,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5863#(<= 40000 ~SIZE~0)} {5855#true} #45#return; {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:18,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {5863#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5863#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:18,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {5863#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5876#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {5876#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5880#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {5880#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:18,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {5884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:18,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {5888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:18,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {5892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5896#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:18,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {5900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5904#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {5904#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:18,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {5908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:18,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {5912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5916#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {5916#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:18,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {5920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:18,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {5924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5928#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5932#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {5932#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5936#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {5936#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5940#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {5940#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:18,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5948#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:18,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {5948#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:18,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {5952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:18,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {5956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !(~i~0 < ~SIZE~0); {5856#false} is VALID [2022-04-08 10:22:18,310 INFO L272 TraceCheckUtils]: 27: Hoare triple {5856#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5856#false} is VALID [2022-04-08 10:22:18,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {5856#false} ~cond := #in~cond; {5856#false} is VALID [2022-04-08 10:22:18,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {5856#false} assume 0 == ~cond; {5856#false} is VALID [2022-04-08 10:22:18,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {5856#false} assume !false; {5856#false} is VALID [2022-04-08 10:22:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:18,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:19,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {5856#false} assume !false; {5856#false} is VALID [2022-04-08 10:22:19,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {5856#false} assume 0 == ~cond; {5856#false} is VALID [2022-04-08 10:22:19,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {5856#false} ~cond := #in~cond; {5856#false} is VALID [2022-04-08 10:22:19,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {5856#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5856#false} is VALID [2022-04-08 10:22:19,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {5984#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {5856#false} is VALID [2022-04-08 10:22:19,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {5988#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5984#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:19,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {5992#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5988#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:19,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {5996#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5992#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:19,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {6000#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {5996#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:19,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {6004#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6000#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:19,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {6008#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6004#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:19,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {6012#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6008#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:19,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {6016#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6012#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:19,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {6020#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6016#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:19,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {6024#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6020#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:19,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {6028#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6024#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:19,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {6032#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6028#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:19,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {6036#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6032#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:19,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {6040#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6036#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:19,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6040#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:19,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {6048#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6044#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:19,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6048#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:19,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6056#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6052#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:19,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6060#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6056#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:19,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {6064#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6060#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:19,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {6068#(< 20 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6064#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:22:19,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {6068#(< 20 ~SIZE~0)} call #t~ret4 := main(); {6068#(< 20 ~SIZE~0)} is VALID [2022-04-08 10:22:19,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6068#(< 20 ~SIZE~0)} {5855#true} #45#return; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-08 10:22:19,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {6068#(< 20 ~SIZE~0)} assume true; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-08 10:22:19,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6068#(< 20 ~SIZE~0)} is VALID [2022-04-08 10:22:19,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {5855#true} call ULTIMATE.init(); {5855#true} is VALID [2022-04-08 10:22:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:19,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144431141] [2022-04-08 10:22:19,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:19,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622428837] [2022-04-08 10:22:19,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622428837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:19,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:19,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-08 10:22:19,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:19,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1348824068] [2022-04-08 10:22:19,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1348824068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:19,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:19,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:22:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149191119] [2022-04-08 10:22:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-08 10:22:19,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:19,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-04-08 10:22:19,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:19,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:22:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:22:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:22:19,183 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-04-08 10:22:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:24,091 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:22:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:22:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-08 10:22:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-04-08 10:22:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-08 10:22:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-04-08 10:22:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-08 10:22:24,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-08 10:22:24,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:24,119 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:22:24,119 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 10:22:24,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:22:24,120 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:24,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:22:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 10:22:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 10:22:24,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:24,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-04-08 10:22:24,144 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-04-08 10:22:24,144 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-04-08 10:22:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:24,145 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:22:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:22:24,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:24,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:24,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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) Second operand 33 states. [2022-04-08 10:22:24,145 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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) Second operand 33 states. [2022-04-08 10:22:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:24,146 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:22:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:22:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:24,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:24,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:24,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-04-08 10:22:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-08 10:22:24,147 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-08 10:22:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:24,147 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-08 10:22:24,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-04-08 10:22:24,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-08 10:22:24,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:22:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:22:24,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:24,175 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:24,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:24,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:24,375 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1608224594, now seen corresponding path program 41 times [2022-04-08 10:22:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:24,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396788672] [2022-04-08 10:22:24,378 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:24,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1608224594, now seen corresponding path program 42 times [2022-04-08 10:22:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:24,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65980212] [2022-04-08 10:22:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:24,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:24,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310651256] [2022-04-08 10:22:24,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:22:24,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:24,408 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:24,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 10:22:24,452 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 10:22:24,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:22:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:24,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:24,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6294#true} is VALID [2022-04-08 10:22:24,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {6294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:24,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {6302#(<= 40000 ~SIZE~0)} assume true; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:24,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6302#(<= 40000 ~SIZE~0)} {6294#true} #45#return; {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:24,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {6302#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6302#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:24,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {6302#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6315#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {6315#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6319#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {6319#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:24,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {6323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:24,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {6327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:24,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {6331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6335#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {6335#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:24,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {6339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6343#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:24,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {6347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6351#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:24,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {6351#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6355#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {6355#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:24,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {6359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:24,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {6363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6367#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {6367#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6371#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {6371#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6375#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {6375#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6379#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {6379#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:24,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {6383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6387#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {6387#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:24,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {6391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:24,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {6395#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6399#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:24,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {6399#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {6295#false} is VALID [2022-04-08 10:22:24,974 INFO L272 TraceCheckUtils]: 28: Hoare triple {6295#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6295#false} is VALID [2022-04-08 10:22:24,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {6295#false} ~cond := #in~cond; {6295#false} is VALID [2022-04-08 10:22:24,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#false} assume 0 == ~cond; {6295#false} is VALID [2022-04-08 10:22:24,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2022-04-08 10:22:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:25,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2022-04-08 10:22:25,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#false} assume 0 == ~cond; {6295#false} is VALID [2022-04-08 10:22:25,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {6295#false} ~cond := #in~cond; {6295#false} is VALID [2022-04-08 10:22:25,936 INFO L272 TraceCheckUtils]: 28: Hoare triple {6295#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6295#false} is VALID [2022-04-08 10:22:25,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {6427#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {6295#false} is VALID [2022-04-08 10:22:25,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {6431#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6427#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:25,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {6435#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6431#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:25,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {6439#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6435#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:25,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {6443#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6439#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:25,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {6447#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6443#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:25,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {6451#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6447#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:25,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {6455#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6451#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:25,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {6459#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6455#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:25,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {6463#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6459#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:25,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {6467#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6463#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:25,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {6471#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6467#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:25,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {6475#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6471#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:25,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {6479#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6475#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:25,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {6483#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6479#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:25,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {6487#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6483#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:25,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {6491#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6487#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:25,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {6495#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6491#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:25,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {6499#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6495#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:25,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6499#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:25,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {6507#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6503#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:25,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {6511#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6507#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:22:25,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {6515#(< 21 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6511#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:22:25,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {6515#(< 21 ~SIZE~0)} call #t~ret4 := main(); {6515#(< 21 ~SIZE~0)} is VALID [2022-04-08 10:22:25,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6515#(< 21 ~SIZE~0)} {6294#true} #45#return; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-08 10:22:25,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6515#(< 21 ~SIZE~0)} assume true; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-08 10:22:25,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {6294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6515#(< 21 ~SIZE~0)} is VALID [2022-04-08 10:22:25,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6294#true} is VALID [2022-04-08 10:22:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65980212] [2022-04-08 10:22:25,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310651256] [2022-04-08 10:22:25,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310651256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:25,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-08 10:22:25,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:25,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396788672] [2022-04-08 10:22:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396788672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:25,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:22:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469301976] [2022-04-08 10:22:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-08 10:22:25,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:25,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-04-08 10:22:25,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:25,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:22:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:25,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:22:25,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:22:25,976 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-04-08 10:22:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:30,752 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:22:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:22:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-08 10:22:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-04-08 10:22:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-08 10:22:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-04-08 10:22:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-08 10:22:30,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-08 10:22:30,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:30,791 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:22:30,791 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:22:30,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:22:30,792 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:30,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:22:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:22:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:22:30,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:30,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-04-08 10:22:30,822 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-04-08 10:22:30,823 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-04-08 10:22:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:30,823 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:22:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:22:30,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:30,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:30,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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) Second operand 34 states. [2022-04-08 10:22:30,824 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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) Second operand 34 states. [2022-04-08 10:22:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:30,824 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:22:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:22:30,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:30,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:30,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:30,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-04-08 10:22:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-08 10:22:30,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-08 10:22:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:30,825 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-08 10:22:30,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-04-08 10:22:30,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-08 10:22:30,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:22:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:22:30,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:30,854 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:30,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:31,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:31,055 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1650150069, now seen corresponding path program 43 times [2022-04-08 10:22:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:31,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1561083424] [2022-04-08 10:22:31,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:31,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1650150069, now seen corresponding path program 44 times [2022-04-08 10:22:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:31,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651790528] [2022-04-08 10:22:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:31,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:31,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269309298] [2022-04-08 10:22:31,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:22:31,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:31,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:31,071 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:31,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:22:31,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:22:31,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:31,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:22:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:31,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:31,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {6747#true} call ULTIMATE.init(); {6747#true} is VALID [2022-04-08 10:22:31,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:31,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {6755#(<= 40000 ~SIZE~0)} assume true; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:31,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6755#(<= 40000 ~SIZE~0)} {6747#true} #45#return; {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:31,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {6755#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:31,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {6755#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {6768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {6772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:31,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:31,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {6780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:31,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {6784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {6788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:31,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {6792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {6796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:31,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {6800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:31,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {6804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {6808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:31,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {6812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:31,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {6816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {6820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {6824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {6832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:31,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {6836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {6840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:31,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {6844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:31,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {6848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:31,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {6852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:22:31,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {6856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !(~i~0 < ~SIZE~0); {6748#false} is VALID [2022-04-08 10:22:31,741 INFO L272 TraceCheckUtils]: 29: Hoare triple {6748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6748#false} is VALID [2022-04-08 10:22:31,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#false} ~cond := #in~cond; {6748#false} is VALID [2022-04-08 10:22:31,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#false} assume 0 == ~cond; {6748#false} is VALID [2022-04-08 10:22:31,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {6748#false} assume !false; {6748#false} is VALID [2022-04-08 10:22:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:31,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:32,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {6748#false} assume !false; {6748#false} is VALID [2022-04-08 10:22:32,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#false} assume 0 == ~cond; {6748#false} is VALID [2022-04-08 10:22:32,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#false} ~cond := #in~cond; {6748#false} is VALID [2022-04-08 10:22:32,785 INFO L272 TraceCheckUtils]: 29: Hoare triple {6748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6748#false} is VALID [2022-04-08 10:22:32,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {6884#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {6748#false} is VALID [2022-04-08 10:22:32,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {6888#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6884#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:32,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {6892#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6888#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:32,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6892#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:32,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {6900#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6896#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:32,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {6904#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6900#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:32,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {6908#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6904#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:32,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {6912#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6908#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:32,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {6916#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6912#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:32,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {6920#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6916#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:32,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6920#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:32,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {6928#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6924#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:32,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {6932#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6928#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:32,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {6936#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6932#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:32,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {6940#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6936#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:32,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {6944#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6940#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:32,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {6948#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6944#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:32,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {6952#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6948#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:32,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {6956#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6952#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:32,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {6960#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6956#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:32,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {6964#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6960#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:32,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {6968#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6964#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:22:32,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {6972#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {6968#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:22:32,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {6976#(< 22 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6972#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:22:32,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {6976#(< 22 ~SIZE~0)} call #t~ret4 := main(); {6976#(< 22 ~SIZE~0)} is VALID [2022-04-08 10:22:32,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6976#(< 22 ~SIZE~0)} {6747#true} #45#return; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-08 10:22:32,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {6976#(< 22 ~SIZE~0)} assume true; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-08 10:22:32,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {6976#(< 22 ~SIZE~0)} is VALID [2022-04-08 10:22:32,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {6747#true} call ULTIMATE.init(); {6747#true} is VALID [2022-04-08 10:22:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651790528] [2022-04-08 10:22:32,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269309298] [2022-04-08 10:22:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269309298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:32,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:32,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-08 10:22:32,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:32,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1561083424] [2022-04-08 10:22:32,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1561083424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:32,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:32,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:22:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311003249] [2022-04-08 10:22:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-08 10:22:32,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:32,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-04-08 10:22:32,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:32,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:22:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:22:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:22:32,823 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-04-08 10:22:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:39,228 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:22:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:22:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-08 10:22:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-04-08 10:22:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 10:22:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-04-08 10:22:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 10:22:39,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-08 10:22:39,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:39,255 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:22:39,255 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 10:22:39,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:22:39,256 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:39,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:22:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 10:22:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 10:22:39,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:39,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-04-08 10:22:39,281 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-04-08 10:22:39,281 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-04-08 10:22:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:39,281 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:22:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:22:39,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:39,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:39,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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) Second operand 35 states. [2022-04-08 10:22:39,282 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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) Second operand 35 states. [2022-04-08 10:22:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:39,282 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:22:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:22:39,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:39,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:39,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:39,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-04-08 10:22:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-08 10:22:39,283 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-08 10:22:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:39,283 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-08 10:22:39,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-04-08 10:22:39,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-08 10:22:39,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:22:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:22:39,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:39,308 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:39,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:39,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:39,527 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 419450482, now seen corresponding path program 45 times [2022-04-08 10:22:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [473809101] [2022-04-08 10:22:39,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:39,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 419450482, now seen corresponding path program 46 times [2022-04-08 10:22:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:39,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75596597] [2022-04-08 10:22:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:39,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113376830] [2022-04-08 10:22:39,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:22:39,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:39,545 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:39,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:22:39,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:22:39,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:39,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:22:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:39,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:40,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {7214#true} call ULTIMATE.init(); {7214#true} is VALID [2022-04-08 10:22:40,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {7214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:40,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {7222#(<= 40000 ~SIZE~0)} assume true; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:40,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7222#(<= 40000 ~SIZE~0)} {7214#true} #45#return; {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:40,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {7222#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7222#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:40,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {7222#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7235#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {7235#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7239#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {7239#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:40,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {7243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:40,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {7247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:40,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {7251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7255#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {7255#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:40,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {7259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7263#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {7263#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:40,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {7267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7271#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:40,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {7271#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7275#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {7275#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:40,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {7279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7283#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:40,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {7283#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7287#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {7287#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7291#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {7291#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7295#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {7295#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7299#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {7299#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:40,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {7303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7307#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {7307#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:40,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {7311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:40,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7319#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:40,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {7319#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:22:40,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {7323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:22:40,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {7327#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !(~i~0 < ~SIZE~0); {7215#false} is VALID [2022-04-08 10:22:40,185 INFO L272 TraceCheckUtils]: 30: Hoare triple {7215#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7215#false} is VALID [2022-04-08 10:22:40,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {7215#false} ~cond := #in~cond; {7215#false} is VALID [2022-04-08 10:22:40,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {7215#false} assume 0 == ~cond; {7215#false} is VALID [2022-04-08 10:22:40,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {7215#false} assume !false; {7215#false} is VALID [2022-04-08 10:22:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:40,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:41,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {7215#false} assume !false; {7215#false} is VALID [2022-04-08 10:22:41,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {7215#false} assume 0 == ~cond; {7215#false} is VALID [2022-04-08 10:22:41,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {7215#false} ~cond := #in~cond; {7215#false} is VALID [2022-04-08 10:22:41,396 INFO L272 TraceCheckUtils]: 30: Hoare triple {7215#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7215#false} is VALID [2022-04-08 10:22:41,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {7355#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {7215#false} is VALID [2022-04-08 10:22:41,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {7359#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7355#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:41,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {7363#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7359#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:41,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {7367#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7363#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:41,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {7371#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7367#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:41,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {7375#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7371#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:41,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {7379#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7375#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:41,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {7383#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7379#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:41,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {7387#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7383#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:41,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {7391#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7387#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:41,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7391#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:41,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {7399#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7395#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:41,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {7403#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7399#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:41,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7403#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:41,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {7411#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7407#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:41,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {7415#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7411#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:41,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {7419#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7415#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:41,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {7423#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7419#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:41,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {7427#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7423#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:41,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {7431#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7427#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:41,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {7435#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7431#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:41,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {7439#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7435#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:22:41,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {7443#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7439#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:22:41,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {7447#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7443#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:22:41,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {7451#(< 23 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7447#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:41,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {7451#(< 23 ~SIZE~0)} call #t~ret4 := main(); {7451#(< 23 ~SIZE~0)} is VALID [2022-04-08 10:22:41,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7451#(< 23 ~SIZE~0)} {7214#true} #45#return; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-08 10:22:41,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {7451#(< 23 ~SIZE~0)} assume true; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-08 10:22:41,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {7214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7451#(< 23 ~SIZE~0)} is VALID [2022-04-08 10:22:41,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {7214#true} call ULTIMATE.init(); {7214#true} is VALID [2022-04-08 10:22:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75596597] [2022-04-08 10:22:41,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113376830] [2022-04-08 10:22:41,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113376830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:41,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:41,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2022-04-08 10:22:41,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:41,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [473809101] [2022-04-08 10:22:41,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [473809101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:41,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:41,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:22:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725165123] [2022-04-08 10:22:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-08 10:22:41,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:41,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-04-08 10:22:41,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:41,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:22:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:22:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:22:41,441 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-04-08 10:22:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:45,656 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:22:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:22:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-08 10:22:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-04-08 10:22:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-08 10:22:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-04-08 10:22:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-08 10:22:45,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-08 10:22:45,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:45,698 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:22:45,698 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:22:45,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:22:45,699 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:45,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:22:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:22:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:22:45,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:45,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-04-08 10:22:45,723 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-04-08 10:22:45,723 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-04-08 10:22:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:45,724 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:22:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:22:45,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:45,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:45,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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) Second operand 36 states. [2022-04-08 10:22:45,724 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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) Second operand 36 states. [2022-04-08 10:22:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:45,724 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:22:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:22:45,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:45,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:45,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:45,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-04-08 10:22:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-08 10:22:45,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-08 10:22:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:45,725 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-08 10:22:45,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-04-08 10:22:45,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-08 10:22:45,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:22:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:22:45,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:45,749 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:45,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:45,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:45,949 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 152558123, now seen corresponding path program 47 times [2022-04-08 10:22:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:45,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695179690] [2022-04-08 10:22:45,952 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:45,952 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 152558123, now seen corresponding path program 48 times [2022-04-08 10:22:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:45,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628021957] [2022-04-08 10:22:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:45,970 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:45,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459688588] [2022-04-08 10:22:45,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:22:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:45,971 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:45,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 10:22:46,015 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 10:22:46,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:46,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:22:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:46,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:46,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2022-04-08 10:22:46,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:46,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {7703#(<= 40000 ~SIZE~0)} assume true; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:46,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7703#(<= 40000 ~SIZE~0)} {7695#true} #45#return; {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:46,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {7703#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7703#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:46,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {7703#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7716#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {7716#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7720#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {7720#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:46,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {7724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:46,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {7728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:46,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {7732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7736#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {7736#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7740#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:46,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {7740#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7744#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {7744#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7748#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:46,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {7748#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:46,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {7752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7756#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {7756#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7760#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:46,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {7760#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:46,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {7764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7768#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {7768#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7772#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {7772#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7776#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7780#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {7780#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:46,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {7784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7788#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {7788#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:46,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {7792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:46,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {7796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7800#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:46,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {7800#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:22:46,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {7804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:22:46,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {7808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:22:46,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {7812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !(~i~0 < ~SIZE~0); {7696#false} is VALID [2022-04-08 10:22:46,629 INFO L272 TraceCheckUtils]: 31: Hoare triple {7696#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7696#false} is VALID [2022-04-08 10:22:46,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2022-04-08 10:22:46,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2022-04-08 10:22:46,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2022-04-08 10:22:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:46,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:22:47,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2022-04-08 10:22:47,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2022-04-08 10:22:47,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2022-04-08 10:22:47,981 INFO L272 TraceCheckUtils]: 31: Hoare triple {7696#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7696#false} is VALID [2022-04-08 10:22:47,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {7840#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {7696#false} is VALID [2022-04-08 10:22:47,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {7844#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7840#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:22:47,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {7848#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7844#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:22:47,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {7852#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7848#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:22:47,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {7856#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7852#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:22:47,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {7860#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7856#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:22:47,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {7864#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7860#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:47,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {7868#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7864#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:22:47,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {7872#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7868#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:47,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {7876#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7872#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:22:47,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {7880#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7876#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:22:47,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {7884#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7880#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:22:47,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {7888#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7884#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:22:47,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {7892#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7888#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:22:47,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {7896#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7892#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:22:47,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {7900#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7896#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:22:47,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {7904#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7900#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:22:47,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {7908#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7904#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:22:47,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {7912#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7908#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:22:47,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {7916#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7912#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:22:47,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {7920#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7916#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:47,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {7924#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7920#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:22:47,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {7928#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7924#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:22:47,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {7932#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7928#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:22:47,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {7936#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {7932#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:22:47,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {7940#(< 24 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7936#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:22:47,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {7940#(< 24 ~SIZE~0)} call #t~ret4 := main(); {7940#(< 24 ~SIZE~0)} is VALID [2022-04-08 10:22:47,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7940#(< 24 ~SIZE~0)} {7695#true} #45#return; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-08 10:22:47,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {7940#(< 24 ~SIZE~0)} assume true; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-08 10:22:47,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {7940#(< 24 ~SIZE~0)} is VALID [2022-04-08 10:22:47,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2022-04-08 10:22:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:22:48,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628021957] [2022-04-08 10:22:48,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:22:48,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459688588] [2022-04-08 10:22:48,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459688588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:22:48,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:22:48,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-04-08 10:22:48,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:22:48,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695179690] [2022-04-08 10:22:48,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695179690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:22:48,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:22:48,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:22:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072389167] [2022-04-08 10:22:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:22:48,001 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-08 10:22:48,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:22:48,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-04-08 10:22:48,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:48,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:22:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:22:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:22:48,025 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-04-08 10:22:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:58,206 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 10:22:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:22:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-08 10:22:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:22:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-04-08 10:22:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-08 10:22:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-04-08 10:22:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-08 10:22:58,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-08 10:22:58,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:58,238 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:22:58,239 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 10:22:58,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:22:58,240 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:22:58,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:22:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 10:22:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 10:22:58,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:22:58,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-04-08 10:22:58,272 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-04-08 10:22:58,272 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-04-08 10:22:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:58,273 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:22:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:22:58,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:58,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:58,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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) Second operand 37 states. [2022-04-08 10:22:58,273 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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) Second operand 37 states. [2022-04-08 10:22:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:22:58,273 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:22:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:22:58,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:22:58,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:22:58,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:22:58,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:22:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-04-08 10:22:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-08 10:22:58,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-08 10:22:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:22:58,274 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-08 10:22:58,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-04-08 10:22:58,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-08 10:22:58,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:22:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:22:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:22:58,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:22:58,303 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:22:58,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 10:22:58,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 10:22:58,511 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:22:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:22:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 468829586, now seen corresponding path program 49 times [2022-04-08 10:22:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:22:58,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550513111] [2022-04-08 10:22:58,514 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:22:58,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:22:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash 468829586, now seen corresponding path program 50 times [2022-04-08 10:22:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:22:58,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328887691] [2022-04-08 10:22:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:22:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:22:58,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:22:58,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120057743] [2022-04-08 10:22:58,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:22:58,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:22:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:22:58,536 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:22:58,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 10:22:58,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:22:58,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:22:58,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:22:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:22:58,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:22:59,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {8190#true} call ULTIMATE.init(); {8190#true} is VALID [2022-04-08 10:22:59,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {8190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:59,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {8198#(<= 40000 ~SIZE~0)} assume true; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:59,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8198#(<= 40000 ~SIZE~0)} {8190#true} #45#return; {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:59,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {8198#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8198#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:22:59,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {8198#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8211#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {8211#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8215#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {8215#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:22:59,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {8219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:22:59,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {8223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:22:59,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {8227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8231#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {8231#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8235#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:22:59,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {8235#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8239#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {8239#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:22:59,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {8243#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:22:59,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {8247#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8251#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {8251#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:22:59,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {8255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:22:59,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {8259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8263#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8267#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {8267#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8271#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {8271#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8275#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {8275#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:22:59,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {8279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8283#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:22:59,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {8287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:22:59,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {8291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8295#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:22:59,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {8295#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:22:59,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {8299#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:22:59,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {8303#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:22:59,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {8307#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:22:59,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {8311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !(~i~0 < ~SIZE~0); {8191#false} is VALID [2022-04-08 10:22:59,228 INFO L272 TraceCheckUtils]: 32: Hoare triple {8191#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8191#false} is VALID [2022-04-08 10:22:59,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {8191#false} ~cond := #in~cond; {8191#false} is VALID [2022-04-08 10:22:59,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {8191#false} assume 0 == ~cond; {8191#false} is VALID [2022-04-08 10:22:59,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {8191#false} assume !false; {8191#false} is VALID [2022-04-08 10:22:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:22:59,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:00,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {8191#false} assume !false; {8191#false} is VALID [2022-04-08 10:23:00,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {8191#false} assume 0 == ~cond; {8191#false} is VALID [2022-04-08 10:23:00,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {8191#false} ~cond := #in~cond; {8191#false} is VALID [2022-04-08 10:23:00,707 INFO L272 TraceCheckUtils]: 32: Hoare triple {8191#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8191#false} is VALID [2022-04-08 10:23:00,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {8339#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {8191#false} is VALID [2022-04-08 10:23:00,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {8343#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8339#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:00,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {8347#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8343#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:00,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {8351#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8347#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:00,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {8355#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8351#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:00,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {8359#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8355#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:00,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {8363#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8359#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:00,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {8367#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8363#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:00,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {8371#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8367#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:00,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {8375#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8371#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:00,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {8379#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8375#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:00,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {8383#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8379#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:00,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {8387#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8383#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:00,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {8391#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8387#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:00,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {8395#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8391#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:00,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {8399#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8395#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:00,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {8403#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8399#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:00,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {8407#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8403#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:00,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {8411#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8407#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:00,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {8415#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8411#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:00,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {8419#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8415#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:00,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {8423#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8419#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:00,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {8427#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8423#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:00,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {8431#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8427#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:00,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8431#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:00,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {8439#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8435#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:00,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {8443#(< 25 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8439#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:00,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {8443#(< 25 ~SIZE~0)} call #t~ret4 := main(); {8443#(< 25 ~SIZE~0)} is VALID [2022-04-08 10:23:00,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8443#(< 25 ~SIZE~0)} {8190#true} #45#return; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-08 10:23:00,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {8443#(< 25 ~SIZE~0)} assume true; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-08 10:23:00,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {8190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8443#(< 25 ~SIZE~0)} is VALID [2022-04-08 10:23:00,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {8190#true} call ULTIMATE.init(); {8190#true} is VALID [2022-04-08 10:23:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:00,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328887691] [2022-04-08 10:23:00,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:00,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120057743] [2022-04-08 10:23:00,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120057743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:00,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:00,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2022-04-08 10:23:00,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:00,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550513111] [2022-04-08 10:23:00,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550513111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:00,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:00,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:23:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744805484] [2022-04-08 10:23:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-08 10:23:00,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:00,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-04-08 10:23:00,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:00,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:23:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:23:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:23:00,757 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-04-08 10:23:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:07,292 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 10:23:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:23:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-08 10:23:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-04-08 10:23:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-08 10:23:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-04-08 10:23:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-08 10:23:07,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-08 10:23:07,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:07,323 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:23:07,324 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:23:07,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:23:07,325 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:07,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:23:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:23:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 10:23:07,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:07,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-04-08 10:23:07,350 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-04-08 10:23:07,350 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-04-08 10:23:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:07,351 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:23:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:23:07,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:07,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:07,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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) Second operand 38 states. [2022-04-08 10:23:07,351 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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) Second operand 38 states. [2022-04-08 10:23:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:07,352 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:23:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:23:07,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:07,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:07,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:07,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-04-08 10:23:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-08 10:23:07,353 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-08 10:23:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:07,353 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-08 10:23:07,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-04-08 10:23:07,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-08 10:23:07,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:23:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:23:07,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:23:07,394 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:23:07,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 10:23:07,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 10:23:07,594 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:23:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:23:07,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310347, now seen corresponding path program 51 times [2022-04-08 10:23:07,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:07,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761884404] [2022-04-08 10:23:07,597 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:23:07,597 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:23:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310347, now seen corresponding path program 52 times [2022-04-08 10:23:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:23:07,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818313906] [2022-04-08 10:23:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:23:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:23:07,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:23:07,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902067643] [2022-04-08 10:23:07,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:23:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:23:07,615 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:23:07,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 10:23:07,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:23:07,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:23:07,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:23:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:23:07,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:23:08,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8699#true} is VALID [2022-04-08 10:23:08,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:08,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8707#(<= 40000 ~SIZE~0)} assume true; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:08,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8707#(<= 40000 ~SIZE~0)} {8699#true} #45#return; {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:08,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {8707#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8707#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:08,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {8707#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8720#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {8720#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8724#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:23:08,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {8728#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:23:08,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {8732#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8736#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:23:08,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {8736#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8740#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {8740#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8744#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:23:08,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {8744#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8748#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {8748#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:23:08,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {8752#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8756#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:23:08,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {8756#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8760#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {8760#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:23:08,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {8764#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:23:08,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {8768#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8772#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {8772#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8776#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {8776#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8780#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {8780#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8784#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {8784#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:23:08,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {8788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8792#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {8792#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:23:08,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {8796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:23:08,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {8800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8804#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:08,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {8804#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:23:08,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {8808#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:23:08,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {8812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:23:08,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {8816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8820#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:23:08,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {8820#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:23:08,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {8824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !(~i~0 < ~SIZE~0); {8700#false} is VALID [2022-04-08 10:23:08,393 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8700#false} is VALID [2022-04-08 10:23:08,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-08 10:23:08,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-08 10:23:08,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-08 10:23:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:08,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:10,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-08 10:23:10,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-08 10:23:10,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-08 10:23:10,062 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8700#false} is VALID [2022-04-08 10:23:10,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {8852#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {8700#false} is VALID [2022-04-08 10:23:10,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {8856#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8852#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:10,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {8860#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8856#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:10,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {8864#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8860#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:10,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {8868#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8864#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:10,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {8872#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8868#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:10,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {8876#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8872#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:10,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {8880#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8876#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:10,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {8884#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8880#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:10,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {8888#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8884#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:10,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8888#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:10,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {8896#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8892#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:10,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {8900#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8896#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:10,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {8904#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8900#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:10,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {8908#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8904#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:10,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {8912#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8908#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:10,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8912#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:10,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {8920#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8916#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:10,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {8924#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8920#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:10,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {8928#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8924#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:10,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {8932#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8928#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:10,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {8936#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8932#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:10,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {8940#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8936#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:10,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {8944#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8940#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:10,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {8948#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8944#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:10,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {8952#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8948#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:10,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {8952#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:10,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {8960#(< 26 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8956#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:23:10,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {8960#(< 26 ~SIZE~0)} call #t~ret4 := main(); {8960#(< 26 ~SIZE~0)} is VALID [2022-04-08 10:23:10,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8960#(< 26 ~SIZE~0)} {8699#true} #45#return; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-08 10:23:10,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {8960#(< 26 ~SIZE~0)} assume true; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-08 10:23:10,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {8960#(< 26 ~SIZE~0)} is VALID [2022-04-08 10:23:10,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8699#true} is VALID [2022-04-08 10:23:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818313906] [2022-04-08 10:23:10,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902067643] [2022-04-08 10:23:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902067643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:10,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2022-04-08 10:23:10,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761884404] [2022-04-08 10:23:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761884404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:10,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 10:23:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984839381] [2022-04-08 10:23:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-08 10:23:10,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:10,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-04-08 10:23:10,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:10,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 10:23:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:10,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 10:23:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:23:10,109 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-04-08 10:23:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:20,319 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 10:23:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:23:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-08 10:23:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-04-08 10:23:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-08 10:23:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-04-08 10:23:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-08 10:23:20,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-08 10:23:20,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:20,362 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:23:20,362 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:23:20,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:23:20,363 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:20,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:23:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:23:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 10:23:20,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:20,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-04-08 10:23:20,388 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-04-08 10:23:20,388 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-04-08 10:23:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:20,389 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:23:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:23:20,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:20,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:20,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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) Second operand 39 states. [2022-04-08 10:23:20,389 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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) Second operand 39 states. [2022-04-08 10:23:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:20,390 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:23:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:23:20,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:20,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:20,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:20,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-04-08 10:23:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-08 10:23:20,391 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-08 10:23:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:20,391 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-08 10:23:20,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-04-08 10:23:20,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-08 10:23:20,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:23:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:23:20,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:23:20,427 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:23:20,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:23:20,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:23:20,627 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:23:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:23:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash 677508274, now seen corresponding path program 53 times [2022-04-08 10:23:20,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:20,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824896354] [2022-04-08 10:23:20,629 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:23:20,629 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:23:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 677508274, now seen corresponding path program 54 times [2022-04-08 10:23:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:23:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549801224] [2022-04-08 10:23:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:23:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:23:20,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:23:20,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414134697] [2022-04-08 10:23:20,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:23:20,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:23:20,648 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:23:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 10:23:20,698 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 10:23:20,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:23:20,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:23:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:23:20,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:23:21,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {9222#true} call ULTIMATE.init(); {9222#true} is VALID [2022-04-08 10:23:21,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {9222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:21,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {9230#(<= 40000 ~SIZE~0)} assume true; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:21,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9230#(<= 40000 ~SIZE~0)} {9222#true} #45#return; {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:21,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {9230#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:21,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {9230#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {9243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {9247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:23:21,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {9251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:23:21,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {9255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:23:21,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {9259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {9263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:23:21,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {9267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {9271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:23:21,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {9275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:23:21,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {9279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {9283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:23:21,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {9287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:23:21,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {9291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {9295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {9299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {9303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {9307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:23:21,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {9311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {9315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:23:21,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {9319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:23:21,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {9323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {9327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:23:21,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {9331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:23:21,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {9335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:23:21,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {9339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:23:21,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {9343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:23:21,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {9347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:21,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {9351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {9223#false} is VALID [2022-04-08 10:23:21,437 INFO L272 TraceCheckUtils]: 34: Hoare triple {9223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9223#false} is VALID [2022-04-08 10:23:21,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {9223#false} ~cond := #in~cond; {9223#false} is VALID [2022-04-08 10:23:21,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {9223#false} assume 0 == ~cond; {9223#false} is VALID [2022-04-08 10:23:21,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {9223#false} assume !false; {9223#false} is VALID [2022-04-08 10:23:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:21,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:23,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {9223#false} assume !false; {9223#false} is VALID [2022-04-08 10:23:23,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {9223#false} assume 0 == ~cond; {9223#false} is VALID [2022-04-08 10:23:23,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {9223#false} ~cond := #in~cond; {9223#false} is VALID [2022-04-08 10:23:23,304 INFO L272 TraceCheckUtils]: 34: Hoare triple {9223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9223#false} is VALID [2022-04-08 10:23:23,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {9379#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {9223#false} is VALID [2022-04-08 10:23:23,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {9383#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9379#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:23,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {9387#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9383#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:23,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {9391#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9387#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:23,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {9395#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9391#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:23,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {9399#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9395#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:23,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {9403#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9399#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:23,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {9407#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9403#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:23,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {9411#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9407#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:23,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {9415#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9411#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:23,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {9419#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9415#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:23,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9419#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:23,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {9427#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9423#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:23,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {9431#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9427#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:23,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9431#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:23,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {9439#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9435#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:23,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {9443#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9439#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:23,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {9447#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9443#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:23,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {9451#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9447#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:23,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {9455#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9451#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:23,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {9459#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9455#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:23,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {9463#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9459#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:23,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {9467#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9463#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:23,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {9471#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9467#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:23,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {9475#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9471#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:23,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {9479#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9475#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:23,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {9483#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9479#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:23,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9483#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:23:23,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {9491#(< 27 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9487#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:23:23,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {9491#(< 27 ~SIZE~0)} call #t~ret4 := main(); {9491#(< 27 ~SIZE~0)} is VALID [2022-04-08 10:23:23,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9491#(< 27 ~SIZE~0)} {9222#true} #45#return; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-08 10:23:23,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {9491#(< 27 ~SIZE~0)} assume true; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-08 10:23:23,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9491#(< 27 ~SIZE~0)} is VALID [2022-04-08 10:23:23,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {9222#true} call ULTIMATE.init(); {9222#true} is VALID [2022-04-08 10:23:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:23,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549801224] [2022-04-08 10:23:23,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414134697] [2022-04-08 10:23:23,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414134697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:23,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:23,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2022-04-08 10:23:23,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824896354] [2022-04-08 10:23:23,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824896354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:23,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:23,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 10:23:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222157698] [2022-04-08 10:23:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-08 10:23:23,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:23,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-04-08 10:23:23,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:23,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 10:23:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 10:23:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:23:23,352 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-04-08 10:23:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:27,691 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 10:23:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:23:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-08 10:23:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-04-08 10:23:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-08 10:23:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-04-08 10:23:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-08 10:23:27,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-08 10:23:27,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:27,722 INFO L225 Difference]: With dead ends: 45 [2022-04-08 10:23:27,722 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 10:23:27,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:23:27,723 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:27,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:23:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 10:23:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 10:23:27,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:27,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-04-08 10:23:27,749 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-04-08 10:23:27,749 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-04-08 10:23:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:27,749 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:23:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:23:27,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:27,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:27,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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) Second operand 40 states. [2022-04-08 10:23:27,750 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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) Second operand 40 states. [2022-04-08 10:23:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:27,750 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:23:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:23:27,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:27,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:27,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:27,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-04-08 10:23:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-08 10:23:27,751 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-08 10:23:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:27,751 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-08 10:23:27,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-04-08 10:23:27,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-08 10:23:27,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:23:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:23:27,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:23:27,778 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:23:27,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 10:23:27,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 10:23:27,978 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:23:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:23:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash -437584917, now seen corresponding path program 55 times [2022-04-08 10:23:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:27,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638606911] [2022-04-08 10:23:27,983 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:23:27,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:23:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash -437584917, now seen corresponding path program 56 times [2022-04-08 10:23:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:23:27,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549935894] [2022-04-08 10:23:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:23:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:23:27,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:23:27,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923031031] [2022-04-08 10:23:27,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:23:27,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:27,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:23:27,997 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:23:27,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 10:23:28,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:23:28,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:23:28,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:23:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:23:28,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:23:28,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {9759#true} call ULTIMATE.init(); {9759#true} is VALID [2022-04-08 10:23:28,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {9759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:28,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {9767#(<= 40000 ~SIZE~0)} assume true; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:28,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9767#(<= 40000 ~SIZE~0)} {9759#true} #45#return; {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:28,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {9767#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9767#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:28,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {9767#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9780#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {9780#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9784#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:23:28,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {9788#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:23:28,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {9792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:23:28,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {9796#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9800#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:23:28,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9808#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {9808#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:23:28,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {9812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:23:28,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {9816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9820#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {9820#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:23:28,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {9824#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9828#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:23:28,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {9828#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9832#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {9832#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9836#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {9836#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9840#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {9840#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9844#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {9844#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:23:28,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {9848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9852#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {9852#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:23:28,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {9856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:23:28,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {9860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9864#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {9864#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:23:28,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {9868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:23:28,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {9872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:23:28,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {9876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:23:28,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {9880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:23:28,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {9884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9888#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:28,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {9888#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:23:28,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {9892#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !(~i~0 < ~SIZE~0); {9760#false} is VALID [2022-04-08 10:23:28,821 INFO L272 TraceCheckUtils]: 35: Hoare triple {9760#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9760#false} is VALID [2022-04-08 10:23:28,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {9760#false} ~cond := #in~cond; {9760#false} is VALID [2022-04-08 10:23:28,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {9760#false} assume 0 == ~cond; {9760#false} is VALID [2022-04-08 10:23:28,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {9760#false} assume !false; {9760#false} is VALID [2022-04-08 10:23:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:28,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:30,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {9760#false} assume !false; {9760#false} is VALID [2022-04-08 10:23:30,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {9760#false} assume 0 == ~cond; {9760#false} is VALID [2022-04-08 10:23:30,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {9760#false} ~cond := #in~cond; {9760#false} is VALID [2022-04-08 10:23:30,936 INFO L272 TraceCheckUtils]: 35: Hoare triple {9760#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9760#false} is VALID [2022-04-08 10:23:30,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {9920#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {9760#false} is VALID [2022-04-08 10:23:30,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {9924#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9920#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:30,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {9928#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9924#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:30,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {9932#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9928#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:30,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {9936#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9932#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:30,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {9940#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9936#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:30,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {9944#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9940#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:30,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {9948#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9944#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:30,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {9952#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9948#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:30,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {9956#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9952#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:30,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {9960#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9956#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:30,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {9964#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9960#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:30,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {9968#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9964#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:30,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {9972#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9968#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:30,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {9976#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9972#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:30,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {9980#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9976#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:30,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {9984#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9980#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:30,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {9988#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9984#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:30,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {9992#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9988#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:30,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9992#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:30,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {10000#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {9996#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:30,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {10004#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10000#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:30,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {10008#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10004#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:30,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {10012#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10008#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:30,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {10016#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10012#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:30,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {10020#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10016#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:30,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {10024#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10020#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:30,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {10028#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10024#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:23:30,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {10032#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10028#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:23:30,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {10036#(< 28 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10032#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:23:30,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {10036#(< 28 ~SIZE~0)} call #t~ret4 := main(); {10036#(< 28 ~SIZE~0)} is VALID [2022-04-08 10:23:30,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10036#(< 28 ~SIZE~0)} {9759#true} #45#return; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-08 10:23:30,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {10036#(< 28 ~SIZE~0)} assume true; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-08 10:23:30,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {9759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10036#(< 28 ~SIZE~0)} is VALID [2022-04-08 10:23:30,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {9759#true} call ULTIMATE.init(); {9759#true} is VALID [2022-04-08 10:23:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549935894] [2022-04-08 10:23:30,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923031031] [2022-04-08 10:23:30,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923031031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:30,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:30,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2022-04-08 10:23:30,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:30,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638606911] [2022-04-08 10:23:30,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638606911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:30,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:30,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:23:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124146789] [2022-04-08 10:23:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:30,961 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-08 10:23:30,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:30,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-04-08 10:23:30,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:30,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:23:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:23:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:23:30,987 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-04-08 10:23:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:39,361 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 10:23:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:23:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-08 10:23:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-04-08 10:23:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 10:23:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-04-08 10:23:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 10:23:39,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-08 10:23:39,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:39,402 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:23:39,402 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 10:23:39,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:23:39,403 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:39,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:23:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 10:23:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 10:23:39,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:39,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-04-08 10:23:39,431 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-04-08 10:23:39,431 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-04-08 10:23:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:39,431 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:23:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:23:39,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:39,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:39,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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) Second operand 41 states. [2022-04-08 10:23:39,432 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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) Second operand 41 states. [2022-04-08 10:23:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:39,432 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:23:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:23:39,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:39,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:39,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:39,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-04-08 10:23:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-08 10:23:39,433 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-08 10:23:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:39,433 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-08 10:23:39,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-04-08 10:23:39,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-08 10:23:39,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:23:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:23:39,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:23:39,464 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:23:39,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-08 10:23:39,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:23:39,671 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:23:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:23:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -645735470, now seen corresponding path program 57 times [2022-04-08 10:23:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:39,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054424130] [2022-04-08 10:23:39,674 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:23:39,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:23:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -645735470, now seen corresponding path program 58 times [2022-04-08 10:23:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:23:39,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961139961] [2022-04-08 10:23:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:23:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:23:39,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:23:39,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117175505] [2022-04-08 10:23:39,686 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:23:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:23:39,687 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:23:39,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 10:23:39,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:23:39,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:23:39,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:23:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:23:39,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:23:40,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {10310#true} call ULTIMATE.init(); {10310#true} is VALID [2022-04-08 10:23:40,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {10310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:40,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {10318#(<= 40000 ~SIZE~0)} assume true; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:40,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10318#(<= 40000 ~SIZE~0)} {10310#true} #45#return; {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:40,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {10318#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10318#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:40,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {10318#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10331#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {10331#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10335#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {10335#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:23:40,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {10339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:23:40,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {10343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:23:40,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {10347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10351#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {10351#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:23:40,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {10355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10359#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {10359#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:23:40,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {10363#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:23:40,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {10367#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10371#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {10371#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:23:40,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:23:40,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {10379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10383#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {10383#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10387#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {10387#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10391#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {10391#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10395#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {10395#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10399#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:23:40,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {10399#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10403#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {10403#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:23:40,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {10407#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10411#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:23:40,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {10411#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10415#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {10415#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10419#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:23:40,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {10419#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:23:40,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {10423#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:23:40,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {10427#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:23:40,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {10431#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:23:40,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {10435#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10439#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:40,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {10439#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10443#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:23:40,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {10443#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:23:40,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {10447#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !(~i~0 < ~SIZE~0); {10311#false} is VALID [2022-04-08 10:23:40,549 INFO L272 TraceCheckUtils]: 36: Hoare triple {10311#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10311#false} is VALID [2022-04-08 10:23:40,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {10311#false} ~cond := #in~cond; {10311#false} is VALID [2022-04-08 10:23:40,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {10311#false} assume 0 == ~cond; {10311#false} is VALID [2022-04-08 10:23:40,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {10311#false} assume !false; {10311#false} is VALID [2022-04-08 10:23:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:40,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:42,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {10311#false} assume !false; {10311#false} is VALID [2022-04-08 10:23:42,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {10311#false} assume 0 == ~cond; {10311#false} is VALID [2022-04-08 10:23:42,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {10311#false} ~cond := #in~cond; {10311#false} is VALID [2022-04-08 10:23:42,858 INFO L272 TraceCheckUtils]: 36: Hoare triple {10311#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10311#false} is VALID [2022-04-08 10:23:42,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {10475#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {10311#false} is VALID [2022-04-08 10:23:42,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {10479#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10475#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:42,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {10483#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10479#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:42,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {10487#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10483#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:42,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {10491#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10487#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:42,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {10495#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10491#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:42,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {10499#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10495#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:42,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {10503#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10499#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:42,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {10507#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10503#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:42,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {10511#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10507#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:42,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {10515#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10511#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:42,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {10519#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10515#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:42,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {10523#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10519#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:42,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {10527#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10523#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:42,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {10531#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10527#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:42,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {10535#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10531#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:42,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {10539#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10535#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:42,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {10543#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10539#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:42,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {10547#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10543#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:42,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {10551#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10547#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:42,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10551#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:42,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {10559#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10555#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:42,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {10563#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10559#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:42,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {10567#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10563#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:42,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {10571#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10567#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:42,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {10575#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10571#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:42,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {10579#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10575#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:42,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {10583#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10579#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:23:42,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {10587#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10583#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:23:42,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {10591#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10587#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:23:42,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {10595#(< 29 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10591#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:42,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {10595#(< 29 ~SIZE~0)} call #t~ret4 := main(); {10595#(< 29 ~SIZE~0)} is VALID [2022-04-08 10:23:42,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10595#(< 29 ~SIZE~0)} {10310#true} #45#return; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-08 10:23:42,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {10595#(< 29 ~SIZE~0)} assume true; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-08 10:23:42,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {10310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10595#(< 29 ~SIZE~0)} is VALID [2022-04-08 10:23:42,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {10310#true} call ULTIMATE.init(); {10310#true} is VALID [2022-04-08 10:23:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961139961] [2022-04-08 10:23:42,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117175505] [2022-04-08 10:23:42,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117175505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:42,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:42,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2022-04-08 10:23:42,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054424130] [2022-04-08 10:23:42,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054424130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:42,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:42,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 10:23:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413410654] [2022-04-08 10:23:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:42,887 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-08 10:23:42,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:42,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-04-08 10:23:42,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:42,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 10:23:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 10:23:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:23:42,915 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-04-08 10:23:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:49,443 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 10:23:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:23:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-08 10:23:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-04-08 10:23:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-08 10:23:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-04-08 10:23:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-08 10:23:49,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-08 10:23:49,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:49,477 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:23:49,477 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 10:23:49,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:23:49,479 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:49,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:23:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 10:23:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 10:23:49,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:49,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-04-08 10:23:49,506 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-04-08 10:23:49,506 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-04-08 10:23:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:49,507 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 10:23:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 10:23:49,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:49,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:49,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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) Second operand 42 states. [2022-04-08 10:23:49,507 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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) Second operand 42 states. [2022-04-08 10:23:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:49,508 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 10:23:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 10:23:49,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:49,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:49,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:49,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-04-08 10:23:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-08 10:23:49,508 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-08 10:23:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:49,509 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-08 10:23:49,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-04-08 10:23:49,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-08 10:23:49,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 10:23:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:23:49,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:23:49,557 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:23:49,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 10:23:49,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:49,758 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:23:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:23:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1491531979, now seen corresponding path program 59 times [2022-04-08 10:23:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385527370] [2022-04-08 10:23:49,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:23:49,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:23:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1491531979, now seen corresponding path program 60 times [2022-04-08 10:23:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:23:49,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846368622] [2022-04-08 10:23:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:23:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:23:49,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:23:49,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046936111] [2022-04-08 10:23:49,775 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:23:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:23:49,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:23:49,776 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:23:49,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 10:23:49,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 10:23:49,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:23:49,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:23:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:23:49,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:23:50,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {10875#true} call ULTIMATE.init(); {10875#true} is VALID [2022-04-08 10:23:50,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {10875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:50,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {10883#(<= 40000 ~SIZE~0)} assume true; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:50,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10883#(<= 40000 ~SIZE~0)} {10875#true} #45#return; {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:50,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {10883#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10883#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:23:50,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {10883#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10896#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {10896#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10900#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {10900#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:23:50,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {10904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:23:50,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {10908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:23:50,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {10912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10916#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {10916#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:23:50,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {10920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10924#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {10924#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:23:50,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {10928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:23:50,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {10932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10936#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {10936#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:23:50,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {10940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:23:50,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {10944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10948#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {10948#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10952#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {10952#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10956#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {10956#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10960#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {10960#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:23:50,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {10964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10968#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {10968#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:23:50,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {10972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:23:50,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {10976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10980#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {10980#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:23:50,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {10984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:23:50,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {10988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10992#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:23:50,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {10992#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {10996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:23:50,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {10996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:23:50,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {11000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11004#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {11004#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:23:50,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {11008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:23:50,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {11012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11016#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:23:50,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {11016#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {10876#false} is VALID [2022-04-08 10:23:50,657 INFO L272 TraceCheckUtils]: 37: Hoare triple {10876#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10876#false} is VALID [2022-04-08 10:23:50,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {10876#false} ~cond := #in~cond; {10876#false} is VALID [2022-04-08 10:23:50,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {10876#false} assume 0 == ~cond; {10876#false} is VALID [2022-04-08 10:23:50,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {10876#false} assume !false; {10876#false} is VALID [2022-04-08 10:23:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:50,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:23:53,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {10876#false} assume !false; {10876#false} is VALID [2022-04-08 10:23:53,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {10876#false} assume 0 == ~cond; {10876#false} is VALID [2022-04-08 10:23:53,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {10876#false} ~cond := #in~cond; {10876#false} is VALID [2022-04-08 10:23:53,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {10876#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10876#false} is VALID [2022-04-08 10:23:53,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {11044#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {10876#false} is VALID [2022-04-08 10:23:53,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {11048#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11044#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:23:53,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {11052#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11048#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:23:53,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {11056#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11052#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:23:53,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {11060#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11056#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:23:53,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {11064#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11060#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:23:53,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {11068#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11064#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {11072#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11068#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:23:53,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11072#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {11080#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11076#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:23:53,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {11084#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11080#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:23:53,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {11088#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11084#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:23:53,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {11092#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11088#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:23:53,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {11096#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11092#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:23:53,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {11100#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11096#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:23:53,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {11104#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11100#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:23:53,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {11108#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11104#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:23:53,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {11112#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11108#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:23:53,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {11116#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11112#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:23:53,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {11120#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11116#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:23:53,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {11124#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11120#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {11128#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11124#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:23:53,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {11132#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11128#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:23:53,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {11136#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11132#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:23:53,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {11140#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11136#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {11144#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11140#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:23:53,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {11148#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11144#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:23:53,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {11152#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11148#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:23:53,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {11156#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11152#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:23:53,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {11160#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11156#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:23:53,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {11164#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11160#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {11168#(< 30 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11164#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:23:53,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {11168#(< 30 ~SIZE~0)} call #t~ret4 := main(); {11168#(< 30 ~SIZE~0)} is VALID [2022-04-08 10:23:53,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11168#(< 30 ~SIZE~0)} {10875#true} #45#return; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-08 10:23:53,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {11168#(< 30 ~SIZE~0)} assume true; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-08 10:23:53,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {10875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11168#(< 30 ~SIZE~0)} is VALID [2022-04-08 10:23:53,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {10875#true} call ULTIMATE.init(); {10875#true} is VALID [2022-04-08 10:23:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:23:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:23:53,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846368622] [2022-04-08 10:23:53,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:23:53,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046936111] [2022-04-08 10:23:53,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046936111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:23:53,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:23:53,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-04-08 10:23:53,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:23:53,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385527370] [2022-04-08 10:23:53,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385527370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:23:53,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:23:53,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 10:23:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884238823] [2022-04-08 10:23:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:23:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-08 10:23:53,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:23:53,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-04-08 10:23:53,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:53,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 10:23:53,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:23:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 10:23:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:23:53,307 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-04-08 10:23:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:59,890 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 10:23:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:23:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-08 10:23:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:23:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-04-08 10:23:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-08 10:23:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-04-08 10:23:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-08 10:23:59,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-08 10:23:59,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:23:59,939 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:23:59,939 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 10:23:59,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:23:59,940 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:23:59,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:23:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 10:23:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 10:23:59,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:23:59,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-04-08 10:23:59,973 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-04-08 10:23:59,973 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-04-08 10:23:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:59,974 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 10:23:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 10:23:59,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:59,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:59,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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) Second operand 43 states. [2022-04-08 10:23:59,974 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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) Second operand 43 states. [2022-04-08 10:23:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:23:59,975 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 10:23:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 10:23:59,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:23:59,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:23:59,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:23:59,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:23:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-04-08 10:23:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-08 10:23:59,975 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-08 10:23:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:23:59,976 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-08 10:23:59,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-04-08 10:23:59,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-08 10:24:00,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 10:24:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:24:00,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:24:00,011 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:24:00,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 10:24:00,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:00,211 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:24:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:24:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -972653838, now seen corresponding path program 61 times [2022-04-08 10:24:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:00,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716590290] [2022-04-08 10:24:00,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:24:00,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:24:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -972653838, now seen corresponding path program 62 times [2022-04-08 10:24:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:24:00,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143392934] [2022-04-08 10:24:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:24:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:24:00,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:24:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895784234] [2022-04-08 10:24:00,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:24:00,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:00,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:24:00,230 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:24:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 10:24:00,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:24:00,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:24:00,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 10:24:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:24:00,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:24:01,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {11454#true} call ULTIMATE.init(); {11454#true} is VALID [2022-04-08 10:24:01,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {11454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:01,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {11462#(<= 40000 ~SIZE~0)} assume true; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:01,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11462#(<= 40000 ~SIZE~0)} {11454#true} #45#return; {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:01,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {11462#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {11462#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:01,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {11462#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11475#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {11475#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11479#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:24:01,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {11483#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:24:01,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {11487#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11491#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:24:01,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {11491#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11495#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {11495#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:24:01,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {11499#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11503#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {11503#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11507#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:24:01,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {11507#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11511#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:24:01,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {11511#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11515#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {11515#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:24:01,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {11519#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:24:01,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {11523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11527#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11531#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {11531#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11535#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {11535#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11539#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {11539#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11543#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:24:01,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {11543#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11547#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {11547#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:24:01,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {11551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11555#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:24:01,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {11555#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11559#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {11559#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:24:01,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {11563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:24:01,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {11567#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:24:01,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {11571#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11575#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:24:01,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {11575#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:24:01,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {11579#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11583#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {11583#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:24:01,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:24:01,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {11591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11595#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {11595#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11599#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:01,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {11599#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {11455#false} is VALID [2022-04-08 10:24:01,170 INFO L272 TraceCheckUtils]: 38: Hoare triple {11455#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11455#false} is VALID [2022-04-08 10:24:01,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {11455#false} ~cond := #in~cond; {11455#false} is VALID [2022-04-08 10:24:01,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {11455#false} assume 0 == ~cond; {11455#false} is VALID [2022-04-08 10:24:01,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {11455#false} assume !false; {11455#false} is VALID [2022-04-08 10:24:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:01,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:24:04,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {11455#false} assume !false; {11455#false} is VALID [2022-04-08 10:24:04,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {11455#false} assume 0 == ~cond; {11455#false} is VALID [2022-04-08 10:24:04,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {11455#false} ~cond := #in~cond; {11455#false} is VALID [2022-04-08 10:24:04,075 INFO L272 TraceCheckUtils]: 38: Hoare triple {11455#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11455#false} is VALID [2022-04-08 10:24:04,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {11627#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {11455#false} is VALID [2022-04-08 10:24:04,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {11631#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11627#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:24:04,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {11635#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11631#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:24:04,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {11639#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11635#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:24:04,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {11643#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11639#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:24:04,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {11647#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11643#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:24:04,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {11651#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11647#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {11655#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11651#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:24:04,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {11659#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11655#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11659#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:24:04,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {11667#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11663#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:24:04,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {11671#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11667#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:24:04,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {11675#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11671#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:24:04,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {11679#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11675#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:24:04,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {11683#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11679#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:24:04,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {11687#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11683#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:24:04,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {11691#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11687#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:24:04,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {11695#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11691#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:24:04,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {11699#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11695#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:24:04,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11699#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:24:04,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {11707#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11703#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {11711#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11707#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:24:04,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {11715#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11711#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:24:04,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {11719#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11715#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:24:04,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {11723#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11719#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {11727#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11723#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:24:04,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {11731#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11727#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:24:04,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {11735#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11731#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:24:04,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {11739#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11735#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:24:04,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {11743#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11739#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:24:04,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {11747#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11743#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {11751#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {11747#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:04,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {11755#(< 31 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11751#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:24:04,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {11755#(< 31 ~SIZE~0)} call #t~ret4 := main(); {11755#(< 31 ~SIZE~0)} is VALID [2022-04-08 10:24:04,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11755#(< 31 ~SIZE~0)} {11454#true} #45#return; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-08 10:24:04,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {11755#(< 31 ~SIZE~0)} assume true; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-08 10:24:04,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {11454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {11755#(< 31 ~SIZE~0)} is VALID [2022-04-08 10:24:04,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {11454#true} call ULTIMATE.init(); {11454#true} is VALID [2022-04-08 10:24:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:04,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:24:04,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143392934] [2022-04-08 10:24:04,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:24:04,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895784234] [2022-04-08 10:24:04,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895784234] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:24:04,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:24:04,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2022-04-08 10:24:04,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:24:04,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716590290] [2022-04-08 10:24:04,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716590290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:24:04,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:24:04,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 10:24:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297366204] [2022-04-08 10:24:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:24:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-08 10:24:04,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:24:04,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-04-08 10:24:04,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:04,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 10:24:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 10:24:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:24:04,133 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-04-08 10:24:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:12,385 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 10:24:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:24:12,386 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-08 10:24:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:24:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-04-08 10:24:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-08 10:24:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-04-08 10:24:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-08 10:24:12,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-08 10:24:12,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:12,422 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:24:12,422 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 10:24:12,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:24:12,423 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:24:12,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:24:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 10:24:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 10:24:12,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:24:12,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-04-08 10:24:12,455 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-04-08 10:24:12,455 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-04-08 10:24:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:12,456 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 10:24:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 10:24:12,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:12,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:12,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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) Second operand 44 states. [2022-04-08 10:24:12,456 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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) Second operand 44 states. [2022-04-08 10:24:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:12,456 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 10:24:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 10:24:12,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:12,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:12,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:24:12,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:24:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-04-08 10:24:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-08 10:24:12,457 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-08 10:24:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:24:12,457 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-08 10:24:12,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-04-08 10:24:12,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-08 10:24:12,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 10:24:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:24:12,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:24:12,491 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:24:12,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 10:24:12,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:12,692 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:24:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:24:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -53002837, now seen corresponding path program 63 times [2022-04-08 10:24:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:12,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616838884] [2022-04-08 10:24:12,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:24:12,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:24:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -53002837, now seen corresponding path program 64 times [2022-04-08 10:24:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:24:12,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628659156] [2022-04-08 10:24:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:24:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:24:12,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:24:12,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508022987] [2022-04-08 10:24:12,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:24:12,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:24:12,708 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:24:12,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 10:24:12,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:24:12,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:24:12,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:24:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:24:12,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:24:13,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {12047#true} call ULTIMATE.init(); {12047#true} is VALID [2022-04-08 10:24:13,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {12047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:13,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#(<= 40000 ~SIZE~0)} assume true; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:13,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#(<= 40000 ~SIZE~0)} {12047#true} #45#return; {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:13,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {12055#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {12055#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:13,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {12055#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12068#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {12068#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12072#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {12072#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:24:13,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12080#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:24:13,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {12080#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:24:13,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {12084#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12088#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {12088#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12092#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:24:13,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {12092#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12096#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {12096#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12100#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:24:13,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {12100#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12104#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:24:13,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {12104#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12108#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {12108#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12112#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:24:13,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {12112#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12116#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:24:13,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {12116#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12120#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {12120#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12124#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {12124#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12128#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {12128#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12132#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {12132#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12136#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:24:13,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12140#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {12140#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12144#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:24:13,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {12144#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12148#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:24:13,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {12148#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12152#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {12152#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12156#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:24:13,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {12156#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12160#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:24:13,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {12160#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12164#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:24:13,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {12164#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12168#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:24:13,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {12168#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12172#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:24:13,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {12172#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12176#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {12176#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12180#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:24:13,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {12180#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12184#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:24:13,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {12184#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12188#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {12188#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12192#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {12192#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12196#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:13,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {12196#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {12048#false} is VALID [2022-04-08 10:24:13,669 INFO L272 TraceCheckUtils]: 39: Hoare triple {12048#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12048#false} is VALID [2022-04-08 10:24:13,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {12048#false} ~cond := #in~cond; {12048#false} is VALID [2022-04-08 10:24:13,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {12048#false} assume 0 == ~cond; {12048#false} is VALID [2022-04-08 10:24:13,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#false} assume !false; {12048#false} is VALID [2022-04-08 10:24:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:13,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:24:16,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#false} assume !false; {12048#false} is VALID [2022-04-08 10:24:16,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {12048#false} assume 0 == ~cond; {12048#false} is VALID [2022-04-08 10:24:16,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {12048#false} ~cond := #in~cond; {12048#false} is VALID [2022-04-08 10:24:16,952 INFO L272 TraceCheckUtils]: 39: Hoare triple {12048#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12048#false} is VALID [2022-04-08 10:24:16,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {12224#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {12048#false} is VALID [2022-04-08 10:24:16,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {12228#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12224#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:24:16,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {12232#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12228#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:24:16,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {12236#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12232#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:24:16,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12236#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:24:16,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {12244#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12240#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:24:16,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {12248#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12244#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {12252#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12248#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:24:16,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {12256#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12252#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {12260#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12256#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:24:16,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {12264#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12260#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:24:16,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {12268#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12264#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:24:16,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {12272#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12268#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:24:16,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {12276#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12272#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:24:16,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12276#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:24:16,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {12284#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12280#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:24:16,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12284#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:24:16,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {12292#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12288#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:24:16,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {12296#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12292#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:24:16,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {12300#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12296#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:24:16,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {12304#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12300#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {12308#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12304#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:24:16,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {12312#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12308#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:24:16,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {12316#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12312#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:24:16,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {12320#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12316#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {12324#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12320#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:24:16,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {12328#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12324#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:24:16,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {12332#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12328#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:24:16,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {12336#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12332#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:24:16,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12336#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:24:16,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {12344#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12340#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {12348#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12344#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {12352#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12348#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:24:16,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {12356#(< 32 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12352#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:16,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {12356#(< 32 ~SIZE~0)} call #t~ret4 := main(); {12356#(< 32 ~SIZE~0)} is VALID [2022-04-08 10:24:16,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12356#(< 32 ~SIZE~0)} {12047#true} #45#return; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-08 10:24:16,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {12356#(< 32 ~SIZE~0)} assume true; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-08 10:24:16,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {12047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12356#(< 32 ~SIZE~0)} is VALID [2022-04-08 10:24:16,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {12047#true} call ULTIMATE.init(); {12047#true} is VALID [2022-04-08 10:24:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:24:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628659156] [2022-04-08 10:24:16,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:24:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508022987] [2022-04-08 10:24:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508022987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:24:16,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:24:16,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2022-04-08 10:24:16,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:24:16,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1616838884] [2022-04-08 10:24:16,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1616838884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:24:16,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:24:16,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 10:24:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077626902] [2022-04-08 10:24:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:24:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-08 10:24:16,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:24:16,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-04-08 10:24:17,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:17,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 10:24:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 10:24:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:24:17,019 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-04-08 10:24:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:23,249 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 10:24:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:24:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-08 10:24:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:24:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-04-08 10:24:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-08 10:24:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-04-08 10:24:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-08 10:24:23,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-08 10:24:23,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:23,288 INFO L225 Difference]: With dead ends: 50 [2022-04-08 10:24:23,288 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 10:24:23,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:24:23,289 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:24:23,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:24:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 10:24:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 10:24:23,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:24:23,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-04-08 10:24:23,319 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-04-08 10:24:23,319 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-04-08 10:24:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:23,320 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 10:24:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 10:24:23,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:23,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:23,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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) Second operand 45 states. [2022-04-08 10:24:23,320 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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) Second operand 45 states. [2022-04-08 10:24:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:23,320 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 10:24:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 10:24:23,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:23,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:23,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:24:23,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:24:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-04-08 10:24:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-08 10:24:23,321 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-08 10:24:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:24:23,321 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-08 10:24:23,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-04-08 10:24:23,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-08 10:24:23,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 10:24:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:24:23,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:24:23,356 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:24:23,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 10:24:23,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-08 10:24:23,571 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:24:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:24:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1608592878, now seen corresponding path program 65 times [2022-04-08 10:24:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245129804] [2022-04-08 10:24:23,574 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:24:23,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:24:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1608592878, now seen corresponding path program 66 times [2022-04-08 10:24:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:24:23,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457003844] [2022-04-08 10:24:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:24:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:24:23,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:24:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809376013] [2022-04-08 10:24:23,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:24:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:23,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:24:23,590 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:24:23,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 10:24:23,644 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-08 10:24:23,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:24:23,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:24:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:24:23,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:24:24,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {12654#true} call ULTIMATE.init(); {12654#true} is VALID [2022-04-08 10:24:24,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {12654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:24,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {12662#(<= 40000 ~SIZE~0)} assume true; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:24,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12662#(<= 40000 ~SIZE~0)} {12654#true} #45#return; {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:24,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {12662#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {12662#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:24,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {12662#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12675#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {12675#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12679#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {12679#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:24:24,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {12683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:24:24,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {12687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:24:24,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {12691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12695#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {12695#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:24:24,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {12699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12703#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {12703#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:24:24,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {12707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:24:24,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {12711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12715#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {12715#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:24:24,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {12719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:24:24,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {12723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12727#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {12727#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12731#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {12731#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12735#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {12735#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12739#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {12739#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:24:24,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {12743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12747#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {12747#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:24:24,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {12751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:24:24,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {12755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12759#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {12759#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12763#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:24:24,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {12763#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:24:24,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {12767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12771#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:24:24,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {12771#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:24:24,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {12775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:24:24,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {12779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12783#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {12783#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:24:24,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {12787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:24:24,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {12791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12795#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {12795#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12799#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {12799#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12803#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:24,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {12803#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12807#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:24:24,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {12807#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !(~i~0 < ~SIZE~0); {12655#false} is VALID [2022-04-08 10:24:24,602 INFO L272 TraceCheckUtils]: 40: Hoare triple {12655#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12655#false} is VALID [2022-04-08 10:24:24,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {12655#false} ~cond := #in~cond; {12655#false} is VALID [2022-04-08 10:24:24,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {12655#false} assume 0 == ~cond; {12655#false} is VALID [2022-04-08 10:24:24,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {12655#false} assume !false; {12655#false} is VALID [2022-04-08 10:24:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:24,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:24:28,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {12655#false} assume !false; {12655#false} is VALID [2022-04-08 10:24:28,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {12655#false} assume 0 == ~cond; {12655#false} is VALID [2022-04-08 10:24:28,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {12655#false} ~cond := #in~cond; {12655#false} is VALID [2022-04-08 10:24:28,438 INFO L272 TraceCheckUtils]: 40: Hoare triple {12655#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12655#false} is VALID [2022-04-08 10:24:28,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {12835#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {12655#false} is VALID [2022-04-08 10:24:28,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {12839#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12835#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:24:28,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {12843#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12839#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:24:28,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {12847#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12843#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:24:28,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {12851#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12847#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:24:28,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {12855#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12851#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:24:28,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {12859#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12855#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {12863#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12859#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:24:28,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {12867#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12863#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {12871#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12867#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:24:28,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {12875#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12871#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:24:28,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {12879#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12875#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:24:28,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {12883#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12879#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:24:28,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {12887#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12883#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:24:28,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {12891#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12887#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:24:28,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {12895#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12891#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:24:28,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {12899#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12895#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:24:28,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {12903#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12899#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:24:28,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {12907#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12903#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:24:28,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {12911#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12907#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:24:28,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {12915#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12911#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {12919#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12915#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:24:28,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {12923#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12919#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:24:28,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {12927#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12923#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:24:28,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {12931#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12927#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {12935#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12931#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:24:28,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {12939#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12935#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:24:28,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {12943#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12939#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:24:28,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {12947#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12943#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:24:28,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {12951#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12947#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:24:28,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {12955#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12951#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {12959#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12955#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {12963#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12959#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:24:28,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {12967#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {12963#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:28,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {12971#(< 33 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12967#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:24:28,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {12971#(< 33 ~SIZE~0)} call #t~ret4 := main(); {12971#(< 33 ~SIZE~0)} is VALID [2022-04-08 10:24:28,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12971#(< 33 ~SIZE~0)} {12654#true} #45#return; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-08 10:24:28,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {12971#(< 33 ~SIZE~0)} assume true; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-08 10:24:28,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {12654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {12971#(< 33 ~SIZE~0)} is VALID [2022-04-08 10:24:28,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {12654#true} call ULTIMATE.init(); {12654#true} is VALID [2022-04-08 10:24:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:24:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457003844] [2022-04-08 10:24:28,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:24:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809376013] [2022-04-08 10:24:28,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809376013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:24:28,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:24:28,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2022-04-08 10:24:28,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:24:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245129804] [2022-04-08 10:24:28,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245129804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:24:28,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:24:28,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 10:24:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142701207] [2022-04-08 10:24:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:24:28,472 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-08 10:24:28,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:24:28,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-04-08 10:24:28,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:28,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 10:24:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 10:24:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:24:28,500 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-04-08 10:24:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:30,769 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 10:24:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:24:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-08 10:24:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:24:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-04-08 10:24:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-08 10:24:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-04-08 10:24:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-08 10:24:30,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-08 10:24:30,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:30,812 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:24:30,812 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 10:24:30,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:24:30,813 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:24:30,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:24:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 10:24:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 10:24:30,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:24:30,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-04-08 10:24:30,848 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-04-08 10:24:30,848 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-04-08 10:24:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:30,849 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 10:24:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 10:24:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:30,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:30,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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) Second operand 46 states. [2022-04-08 10:24:30,849 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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) Second operand 46 states. [2022-04-08 10:24:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:30,850 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 10:24:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 10:24:30,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:30,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:30,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:24:30,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:24:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-04-08 10:24:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-08 10:24:30,851 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-08 10:24:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:24:30,851 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-08 10:24:30,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-04-08 10:24:30,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-08 10:24:30,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 10:24:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:24:30,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:24:30,893 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:24:30,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 10:24:31,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:31,093 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:24:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:24:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1707723403, now seen corresponding path program 67 times [2022-04-08 10:24:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997706977] [2022-04-08 10:24:31,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:24:31,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:24:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1707723403, now seen corresponding path program 68 times [2022-04-08 10:24:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:24:31,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170491420] [2022-04-08 10:24:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:24:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:24:31,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:24:31,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829220853] [2022-04-08 10:24:31,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:24:31,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:31,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:24:31,110 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:24:31,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 10:24:31,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:24:31,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:24:31,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:24:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:24:31,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:24:32,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {13275#true} call ULTIMATE.init(); {13275#true} is VALID [2022-04-08 10:24:32,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {13275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:32,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {13283#(<= 40000 ~SIZE~0)} assume true; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:32,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13283#(<= 40000 ~SIZE~0)} {13275#true} #45#return; {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:32,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {13283#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {13283#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:32,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {13283#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13296#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {13296#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13300#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {13300#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:24:32,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {13304#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:24:32,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {13308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:24:32,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {13312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13316#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {13316#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:24:32,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {13320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13324#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {13324#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:24:32,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {13328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:24:32,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {13332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13336#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {13336#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:24:32,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {13340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:24:32,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {13344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13348#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {13348#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13352#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {13352#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13356#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {13356#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13360#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {13360#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:24:32,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {13364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13368#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {13368#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:24:32,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {13372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:24:32,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {13376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13380#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {13380#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:24:32,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {13384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:24:32,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {13388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:24:32,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {13392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:24:32,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {13396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13400#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:24:32,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {13400#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13404#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {13404#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:24:32,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {13408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:24:32,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {13412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13416#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {13416#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13420#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {13420#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13424#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:32,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {13424#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:24:32,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {13428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:24:32,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {13432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !(~i~0 < ~SIZE~0); {13276#false} is VALID [2022-04-08 10:24:32,137 INFO L272 TraceCheckUtils]: 41: Hoare triple {13276#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13276#false} is VALID [2022-04-08 10:24:32,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {13276#false} ~cond := #in~cond; {13276#false} is VALID [2022-04-08 10:24:32,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {13276#false} assume 0 == ~cond; {13276#false} is VALID [2022-04-08 10:24:32,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {13276#false} assume !false; {13276#false} is VALID [2022-04-08 10:24:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:32,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:24:36,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {13276#false} assume !false; {13276#false} is VALID [2022-04-08 10:24:36,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {13276#false} assume 0 == ~cond; {13276#false} is VALID [2022-04-08 10:24:36,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {13276#false} ~cond := #in~cond; {13276#false} is VALID [2022-04-08 10:24:36,541 INFO L272 TraceCheckUtils]: 41: Hoare triple {13276#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13276#false} is VALID [2022-04-08 10:24:36,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {13460#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {13276#false} is VALID [2022-04-08 10:24:36,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {13464#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13460#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:24:36,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {13468#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13464#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:24:36,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {13472#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13468#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:24:36,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {13476#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13472#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:24:36,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {13480#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13476#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:24:36,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13480#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {13488#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13484#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:24:36,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {13492#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13488#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {13496#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13492#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:24:36,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {13500#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13496#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:24:36,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {13504#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13500#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:24:36,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {13508#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13504#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:24:36,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {13512#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13508#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:24:36,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {13516#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13512#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:24:36,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13516#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:24:36,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {13524#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13520#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:24:36,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {13528#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13524#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:24:36,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {13532#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13528#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:24:36,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {13536#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13532#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:24:36,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {13540#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13536#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {13544#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13540#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:24:36,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {13548#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13544#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:24:36,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {13552#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13548#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:24:36,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {13556#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13552#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {13560#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13556#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:24:36,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {13564#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13560#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:24:36,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {13568#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13564#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:24:36,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {13572#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13568#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:24:36,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {13576#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13572#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:24:36,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {13580#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13576#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {13584#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13580#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {13588#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13584#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:24:36,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {13592#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13588#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:36,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {13596#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13592#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:24:36,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {13600#(< 34 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13596#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:24:36,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {13600#(< 34 ~SIZE~0)} call #t~ret4 := main(); {13600#(< 34 ~SIZE~0)} is VALID [2022-04-08 10:24:36,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13600#(< 34 ~SIZE~0)} {13275#true} #45#return; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-08 10:24:36,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {13600#(< 34 ~SIZE~0)} assume true; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-08 10:24:36,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {13275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13600#(< 34 ~SIZE~0)} is VALID [2022-04-08 10:24:36,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {13275#true} call ULTIMATE.init(); {13275#true} is VALID [2022-04-08 10:24:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:24:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170491420] [2022-04-08 10:24:36,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:24:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829220853] [2022-04-08 10:24:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829220853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:24:36,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:24:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2022-04-08 10:24:36,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:24:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997706977] [2022-04-08 10:24:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997706977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:24:36,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:24:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 10:24:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443196267] [2022-04-08 10:24:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:24:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-08 10:24:36,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:24:36,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-04-08 10:24:36,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:36,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 10:24:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 10:24:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 10:24:36,620 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-04-08 10:24:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:42,859 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 10:24:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:24:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-08 10:24:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:24:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-04-08 10:24:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-08 10:24:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-04-08 10:24:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-08 10:24:42,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-08 10:24:42,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:42,899 INFO L225 Difference]: With dead ends: 52 [2022-04-08 10:24:42,899 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:24:42,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 10:24:42,900 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:24:42,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:24:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:24:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 10:24:42,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:24:42,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-04-08 10:24:42,933 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-04-08 10:24:42,933 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-04-08 10:24:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:42,934 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 10:24:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 10:24:42,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:42,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:42,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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) Second operand 47 states. [2022-04-08 10:24:42,934 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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) Second operand 47 states. [2022-04-08 10:24:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:24:42,934 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 10:24:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 10:24:42,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:24:42,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:24:42,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:24:42,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:24:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-04-08 10:24:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-08 10:24:42,935 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-08 10:24:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:24:42,936 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-08 10:24:42,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-04-08 10:24:42,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-08 10:24:42,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 10:24:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 10:24:42,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:24:42,976 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:24:42,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 10:24:43,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 10:24:43,185 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:24:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:24:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1434313010, now seen corresponding path program 69 times [2022-04-08 10:24:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:43,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256611292] [2022-04-08 10:24:43,192 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:24:43,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:24:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1434313010, now seen corresponding path program 70 times [2022-04-08 10:24:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:24:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133983972] [2022-04-08 10:24:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:24:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:24:43,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:24:43,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961885620] [2022-04-08 10:24:43,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:24:43,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:24:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:24:43,207 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:24:43,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 10:24:43,258 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:24:43,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:24:43,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 10:24:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:24:43,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:24:44,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-08 10:24:44,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:44,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {13918#(<= 40000 ~SIZE~0)} assume true; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:44,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13918#(<= 40000 ~SIZE~0)} {13910#true} #45#return; {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:44,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {13918#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {13918#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:24:44,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {13918#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {13931#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {13931#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13935#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:24:44,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {13939#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13943#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:24:44,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {13943#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13947#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:24:44,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {13947#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13951#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {13951#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13955#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:24:44,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {13955#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13959#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {13959#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13963#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:24:44,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {13963#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13967#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:24:44,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {13967#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13971#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {13971#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13975#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:24:44,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {13975#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:24:44,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {13979#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13983#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {13983#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13987#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {13987#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13991#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {13991#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13995#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {13995#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {13999#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:24:44,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {13999#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14003#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {14003#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:24:44,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {14007#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14011#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:24:44,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {14011#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14015#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {14015#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14019#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:24:44,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {14019#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14023#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:24:44,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {14023#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14027#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:24:44,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {14027#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14031#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:24:44,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {14031#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14035#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:24:44,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {14035#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14039#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {14039#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:24:44,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {14043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:24:44,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {14047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14051#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {14051#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14055#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {14055#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14059#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:24:44,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {14059#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:24:44,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {14063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:24:44,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {14067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:24:44,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {14071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !(~i~0 < ~SIZE~0); {13911#false} is VALID [2022-04-08 10:24:44,322 INFO L272 TraceCheckUtils]: 42: Hoare triple {13911#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13911#false} is VALID [2022-04-08 10:24:44,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-08 10:24:44,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-08 10:24:44,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-08 10:24:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:44,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:24:49,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-08 10:24:49,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-08 10:24:49,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-08 10:24:49,535 INFO L272 TraceCheckUtils]: 42: Hoare triple {13911#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {13911#false} is VALID [2022-04-08 10:24:49,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {14099#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {13911#false} is VALID [2022-04-08 10:24:49,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {14103#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14099#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:24:49,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {14107#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14103#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:24:49,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {14111#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14107#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:24:49,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {14115#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14111#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:24:49,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {14119#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14115#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:24:49,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {14123#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14119#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {14127#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14123#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:24:49,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {14131#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14127#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {14135#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14131#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:24:49,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14135#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:24:49,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {14143#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14139#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:24:49,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {14147#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14143#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:24:49,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {14151#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14147#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:24:49,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {14155#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14151#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:24:49,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {14159#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14155#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:24:49,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {14163#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14159#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:24:49,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {14167#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14163#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:24:49,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {14171#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14167#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:24:49,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {14175#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14171#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:24:49,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {14179#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14175#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {14183#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14179#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:24:49,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {14187#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14183#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:24:49,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {14191#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14187#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:24:49,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {14195#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14191#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {14199#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14195#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:24:49,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {14203#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14199#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:24:49,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {14207#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14203#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:24:49,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {14211#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14207#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:24:49,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {14215#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14211#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:24:49,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {14219#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14215#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {14223#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14219#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {14227#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14223#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:24:49,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {14231#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14227#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {14235#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14231#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:24:49,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {14239#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14235#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:24:49,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {14243#(< 35 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14239#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:24:49,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {14243#(< 35 ~SIZE~0)} call #t~ret4 := main(); {14243#(< 35 ~SIZE~0)} is VALID [2022-04-08 10:24:49,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14243#(< 35 ~SIZE~0)} {13910#true} #45#return; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-08 10:24:49,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {14243#(< 35 ~SIZE~0)} assume true; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-08 10:24:49,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14243#(< 35 ~SIZE~0)} is VALID [2022-04-08 10:24:49,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-08 10:24:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:24:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:24:49,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133983972] [2022-04-08 10:24:49,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:24:49,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961885620] [2022-04-08 10:24:49,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961885620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:24:49,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:24:49,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2022-04-08 10:24:49,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:24:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256611292] [2022-04-08 10:24:49,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256611292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:24:49,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:24:49,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 10:24:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886267467] [2022-04-08 10:24:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:24:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-08 10:24:49,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:24:49,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-04-08 10:24:49,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:24:49,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 10:24:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:24:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 10:24:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:24:49,604 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-04-08 10:25:00,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:25:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:01,016 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 10:25:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:25:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-08 10:25:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-04-08 10:25:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-08 10:25:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-04-08 10:25:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-08 10:25:01,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-08 10:25:01,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:01,061 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:25:01,061 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:25:01,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:25:01,062 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:01,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:25:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:25:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 10:25:01,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:01,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-04-08 10:25:01,094 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-04-08 10:25:01,094 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-04-08 10:25:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:01,094 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 10:25:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 10:25:01,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:01,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:01,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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) Second operand 48 states. [2022-04-08 10:25:01,095 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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) Second operand 48 states. [2022-04-08 10:25:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:01,095 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 10:25:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 10:25:01,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:01,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:01,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:01,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-04-08 10:25:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-08 10:25:01,096 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-08 10:25:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:01,096 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-08 10:25:01,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-04-08 10:25:01,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-08 10:25:01,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 10:25:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 10:25:01,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:01,133 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:01,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 10:25:01,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:01,333 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1548525419, now seen corresponding path program 71 times [2022-04-08 10:25:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:01,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649520754] [2022-04-08 10:25:01,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:25:01,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:25:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1548525419, now seen corresponding path program 72 times [2022-04-08 10:25:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:01,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758874556] [2022-04-08 10:25:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:01,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:01,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:25:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298014310] [2022-04-08 10:25:01,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:25:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:25:01,367 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:25:01,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 10:25:01,425 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 10:25:01,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:25:01,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:25:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:01,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:25:02,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {14559#true} call ULTIMATE.init(); {14559#true} is VALID [2022-04-08 10:25:02,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {14559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:02,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {14567#(<= 40000 ~SIZE~0)} assume true; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:02,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14567#(<= 40000 ~SIZE~0)} {14559#true} #45#return; {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:02,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {14567#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {14567#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:02,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {14567#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14580#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14584#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {14584#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14588#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:25:02,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {14588#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:25:02,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {14592#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:25:02,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {14596#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14600#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {14600#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:25:02,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {14604#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14608#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {14608#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14612#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:25:02,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:25:02,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {14616#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14620#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {14620#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14624#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:25:02,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {14624#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:25:02,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {14628#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14632#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {14632#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14636#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {14636#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14640#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {14640#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14644#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {14644#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14648#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:25:02,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {14648#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14652#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {14652#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14656#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:25:02,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {14656#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14660#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:25:02,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {14660#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14664#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {14664#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14668#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:25:02,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {14668#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14672#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:25:02,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {14672#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14676#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:25:02,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {14676#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14680#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:25:02,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {14680#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14684#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:25:02,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {14684#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14688#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {14688#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14692#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:25:02,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {14692#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14696#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:25:02,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {14696#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14700#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {14700#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14704#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {14704#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14708#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:02,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {14708#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:25:02,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {14712#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:25:02,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {14716#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14720#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:25:02,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {14720#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:25:02,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {14724#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !(~i~0 < ~SIZE~0); {14560#false} is VALID [2022-04-08 10:25:02,520 INFO L272 TraceCheckUtils]: 43: Hoare triple {14560#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {14560#false} is VALID [2022-04-08 10:25:02,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {14560#false} ~cond := #in~cond; {14560#false} is VALID [2022-04-08 10:25:02,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {14560#false} assume 0 == ~cond; {14560#false} is VALID [2022-04-08 10:25:02,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {14560#false} assume !false; {14560#false} is VALID [2022-04-08 10:25:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:02,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:25:08,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {14560#false} assume !false; {14560#false} is VALID [2022-04-08 10:25:08,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {14560#false} assume 0 == ~cond; {14560#false} is VALID [2022-04-08 10:25:08,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {14560#false} ~cond := #in~cond; {14560#false} is VALID [2022-04-08 10:25:08,960 INFO L272 TraceCheckUtils]: 43: Hoare triple {14560#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {14560#false} is VALID [2022-04-08 10:25:08,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {14752#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {14560#false} is VALID [2022-04-08 10:25:08,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {14756#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14752#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:25:08,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {14760#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14756#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:25:08,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {14764#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14760#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:25:08,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {14768#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14764#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:25:08,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {14772#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14768#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:25:08,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {14776#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14772#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {14780#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14776#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:25:08,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {14784#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14780#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {14788#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14784#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:25:08,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {14792#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14788#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:25:08,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {14796#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14792#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:25:08,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {14800#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14796#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:25:08,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {14804#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14800#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:25:08,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {14808#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14804#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:25:08,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {14812#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14808#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:25:08,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {14816#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14812#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:25:08,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {14820#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14816#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:25:08,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {14824#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14820#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:25:08,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {14828#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14824#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:25:08,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {14832#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14828#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {14836#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14832#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:25:08,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {14840#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14836#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:25:08,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {14844#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14840#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:25:08,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {14848#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14844#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {14852#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14848#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:25:08,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {14856#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14852#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:25:08,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {14860#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14856#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:25:08,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {14864#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14860#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:25:08,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {14868#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14864#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:25:08,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {14872#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14868#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {14876#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14872#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {14880#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14876#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:25:08,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {14884#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14880#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {14888#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14884#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:25:08,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {14892#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14888#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:25:08,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {14896#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {14892#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:08,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {14900#(< 36 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {14896#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:25:08,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {14900#(< 36 ~SIZE~0)} call #t~ret4 := main(); {14900#(< 36 ~SIZE~0)} is VALID [2022-04-08 10:25:08,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14900#(< 36 ~SIZE~0)} {14559#true} #45#return; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-08 10:25:08,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {14900#(< 36 ~SIZE~0)} assume true; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-08 10:25:08,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {14559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {14900#(< 36 ~SIZE~0)} is VALID [2022-04-08 10:25:08,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {14559#true} call ULTIMATE.init(); {14559#true} is VALID [2022-04-08 10:25:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:08,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758874556] [2022-04-08 10:25:08,999 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:25:08,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298014310] [2022-04-08 10:25:08,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298014310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:25:08,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:25:08,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2022-04-08 10:25:08,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:08,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649520754] [2022-04-08 10:25:08,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649520754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:08,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:08,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 10:25:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301525698] [2022-04-08 10:25:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:09,000 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-08 10:25:09,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:09,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-04-08 10:25:09,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:09,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 10:25:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 10:25:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:25:09,036 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-04-08 10:25:13,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:25:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:17,376 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 10:25:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 10:25:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-08 10:25:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-04-08 10:25:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-08 10:25:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-04-08 10:25:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-08 10:25:17,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-08 10:25:17,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:17,443 INFO L225 Difference]: With dead ends: 54 [2022-04-08 10:25:17,443 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:25:17,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:25:17,444 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:17,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:25:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:25:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 10:25:17,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:17,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-04-08 10:25:17,482 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-04-08 10:25:17,482 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-04-08 10:25:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:17,483 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 10:25:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 10:25:17,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:17,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:17,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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) Second operand 49 states. [2022-04-08 10:25:17,483 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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) Second operand 49 states. [2022-04-08 10:25:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:17,484 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 10:25:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 10:25:17,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:17,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:17,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:17,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-04-08 10:25:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-08 10:25:17,485 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-08 10:25:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:17,485 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-08 10:25:17,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-04-08 10:25:17,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-08 10:25:17,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 10:25:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 10:25:17,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:17,532 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:17,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 10:25:17,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 10:25:17,732 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 794142802, now seen corresponding path program 73 times [2022-04-08 10:25:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:17,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184268738] [2022-04-08 10:25:17,736 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:25:17,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:25:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 794142802, now seen corresponding path program 74 times [2022-04-08 10:25:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037316493] [2022-04-08 10:25:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:17,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:25:17,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980565779] [2022-04-08 10:25:17,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:25:17,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:17,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:25:17,751 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:25:17,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 10:25:17,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:25:17,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:25:17,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 10:25:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:17,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:25:18,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {15222#true} call ULTIMATE.init(); {15222#true} is VALID [2022-04-08 10:25:18,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {15222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:18,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {15230#(<= 40000 ~SIZE~0)} assume true; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:18,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15230#(<= 40000 ~SIZE~0)} {15222#true} #45#return; {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:18,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {15230#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {15230#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:18,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {15230#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {15243#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {15247#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:25:18,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {15251#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:25:18,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {15255#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:25:18,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {15259#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {15263#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:25:18,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {15267#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {15271#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:25:18,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {15275#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:25:18,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {15279#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {15283#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:25:18,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {15287#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:25:18,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {15291#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {15295#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {15299#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {15303#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {15307#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:25:18,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {15311#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {15315#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:25:18,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {15319#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:25:18,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {15323#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {15327#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:25:18,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {15331#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:25:18,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {15335#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:25:18,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {15339#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:25:18,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {15343#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:25:18,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {15347#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {15351#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:25:18,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {15355#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:25:18,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {15359#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15363#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {15363#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15367#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {15367#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15371#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:18,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {15371#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:25:18,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {15375#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:25:18,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {15379#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:25:18,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {15383#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:25:18,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {15387#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:25:18,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {15391#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !(~i~0 < ~SIZE~0); {15223#false} is VALID [2022-04-08 10:25:18,966 INFO L272 TraceCheckUtils]: 44: Hoare triple {15223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15223#false} is VALID [2022-04-08 10:25:18,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {15223#false} ~cond := #in~cond; {15223#false} is VALID [2022-04-08 10:25:18,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {15223#false} assume 0 == ~cond; {15223#false} is VALID [2022-04-08 10:25:18,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {15223#false} assume !false; {15223#false} is VALID [2022-04-08 10:25:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:18,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:25:26,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {15223#false} assume !false; {15223#false} is VALID [2022-04-08 10:25:26,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {15223#false} assume 0 == ~cond; {15223#false} is VALID [2022-04-08 10:25:26,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {15223#false} ~cond := #in~cond; {15223#false} is VALID [2022-04-08 10:25:26,819 INFO L272 TraceCheckUtils]: 44: Hoare triple {15223#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15223#false} is VALID [2022-04-08 10:25:26,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {15419#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {15223#false} is VALID [2022-04-08 10:25:26,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {15423#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15419#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:25:26,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {15427#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15423#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:25:26,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {15431#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15427#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:25:26,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {15435#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15431#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:25:26,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {15439#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15435#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:25:26,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {15443#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15439#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {15447#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15443#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:25:26,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {15451#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15447#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {15455#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15451#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:25:26,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {15459#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15455#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:25:26,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {15463#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15459#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:25:26,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {15467#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15463#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:25:26,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {15471#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15467#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:25:26,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {15475#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15471#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:25:26,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {15479#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15475#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:25:26,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {15483#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15479#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:25:26,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {15487#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15483#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:25:26,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {15491#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15487#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:25:26,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {15495#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15491#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:25:26,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15495#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {15503#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15499#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:25:26,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {15507#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15503#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:25:26,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {15511#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15507#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:25:26,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {15515#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15511#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {15519#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15515#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:25:26,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {15523#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15519#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:25:26,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {15527#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15523#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:25:26,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {15531#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15527#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:25:26,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {15535#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15531#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:25:26,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {15539#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15535#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {15543#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15539#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {15547#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15543#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:25:26,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {15551#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15547#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {15555#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15551#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:25:26,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {15559#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15555#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:25:26,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {15563#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15559#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:26,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {15567#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15563#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:25:26,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {15571#(< 37 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15567#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:25:26,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {15571#(< 37 ~SIZE~0)} call #t~ret4 := main(); {15571#(< 37 ~SIZE~0)} is VALID [2022-04-08 10:25:26,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15571#(< 37 ~SIZE~0)} {15222#true} #45#return; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-08 10:25:26,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {15571#(< 37 ~SIZE~0)} assume true; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-08 10:25:26,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {15222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15571#(< 37 ~SIZE~0)} is VALID [2022-04-08 10:25:26,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {15222#true} call ULTIMATE.init(); {15222#true} is VALID [2022-04-08 10:25:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037316493] [2022-04-08 10:25:26,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:25:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980565779] [2022-04-08 10:25:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980565779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:25:26,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:25:26,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 80 [2022-04-08 10:25:26,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184268738] [2022-04-08 10:25:26,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184268738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:26,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 10:25:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079080760] [2022-04-08 10:25:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-08 10:25:26,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:26,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-04-08 10:25:26,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:26,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 10:25:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 10:25:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:25:26,899 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-04-08 10:25:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:39,295 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 10:25:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 10:25:39,295 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-08 10:25:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-04-08 10:25:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-08 10:25:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-04-08 10:25:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-08 10:25:39,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-08 10:25:39,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:39,345 INFO L225 Difference]: With dead ends: 55 [2022-04-08 10:25:39,345 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 10:25:39,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:25:39,346 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:39,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:25:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 10:25:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 10:25:39,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:39,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-04-08 10:25:39,381 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-04-08 10:25:39,381 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-04-08 10:25:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:39,382 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 10:25:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 10:25:39,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:39,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:39,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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) Second operand 50 states. [2022-04-08 10:25:39,382 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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) Second operand 50 states. [2022-04-08 10:25:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:39,383 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 10:25:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 10:25:39,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:39,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:39,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:39,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-04-08 10:25:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-08 10:25:39,384 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-08 10:25:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:39,384 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-08 10:25:39,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-04-08 10:25:39,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-08 10:25:39,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 10:25:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:25:39,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:39,427 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:39,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 10:25:39,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 10:25:39,643 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1116881845, now seen corresponding path program 75 times [2022-04-08 10:25:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:39,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479864964] [2022-04-08 10:25:39,646 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:25:39,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:25:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1116881845, now seen corresponding path program 76 times [2022-04-08 10:25:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:39,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588833102] [2022-04-08 10:25:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:39,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:25:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072316842] [2022-04-08 10:25:39,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:25:39,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:25:39,667 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:25:39,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 10:25:39,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:25:39,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:25:39,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:25:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:39,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:25:40,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {15899#true} call ULTIMATE.init(); {15899#true} is VALID [2022-04-08 10:25:40,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {15899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:40,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15907#(<= 40000 ~SIZE~0)} assume true; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:40,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15907#(<= 40000 ~SIZE~0)} {15899#true} #45#return; {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:40,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {15907#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {15907#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:25:40,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {15907#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {15920#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {15920#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15924#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {15924#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:25:40,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {15928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:25:40,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {15932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:25:40,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {15936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15940#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:25:40,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {15944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15948#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {15948#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:25:40,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {15952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:25:40,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {15956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15960#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {15960#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:25:40,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {15964#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15968#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:25:40,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {15968#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15972#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {15972#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15976#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {15976#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15980#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {15980#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15984#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {15984#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:25:40,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {15988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15992#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {15992#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {15996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:25:40,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {15996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:25:40,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {16000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16004#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {16004#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:25:40,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {16008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:25:40,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {16012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:25:40,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {16016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:25:40,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {16020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:25:40,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {16024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16028#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {16028#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16032#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:25:40,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {16032#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16036#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:25:40,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {16036#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16040#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {16040#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16044#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {16044#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16048#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {16048#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:25:40,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {16052#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:25:40,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {16056#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16060#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:25:40,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {16060#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:25:40,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {16064#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16068#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:25:40,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {16068#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16072#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:25:40,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {16072#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {15900#false} is VALID [2022-04-08 10:25:40,848 INFO L272 TraceCheckUtils]: 45: Hoare triple {15900#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15900#false} is VALID [2022-04-08 10:25:40,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {15900#false} ~cond := #in~cond; {15900#false} is VALID [2022-04-08 10:25:40,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {15900#false} assume 0 == ~cond; {15900#false} is VALID [2022-04-08 10:25:40,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {15900#false} assume !false; {15900#false} is VALID [2022-04-08 10:25:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:40,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:25:51,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {15900#false} assume !false; {15900#false} is VALID [2022-04-08 10:25:51,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {15900#false} assume 0 == ~cond; {15900#false} is VALID [2022-04-08 10:25:51,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {15900#false} ~cond := #in~cond; {15900#false} is VALID [2022-04-08 10:25:51,648 INFO L272 TraceCheckUtils]: 45: Hoare triple {15900#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {15900#false} is VALID [2022-04-08 10:25:51,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {16100#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {15900#false} is VALID [2022-04-08 10:25:51,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {16104#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16100#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:25:51,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {16108#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16104#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:25:51,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {16112#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16108#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:25:51,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {16116#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16112#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:25:51,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {16120#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16116#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:25:51,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {16124#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16120#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {16128#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16124#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:25:51,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {16132#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16128#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {16136#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16132#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:25:51,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {16140#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16136#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:25:51,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {16144#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16140#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:25:51,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {16148#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16144#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:25:51,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {16152#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16148#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:25:51,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {16156#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16152#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:25:51,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {16160#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16156#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:25:51,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {16164#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16160#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:25:51,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {16168#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16164#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:25:51,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {16172#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16168#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:25:51,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {16176#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16172#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:25:51,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {16180#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16176#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {16184#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16180#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:25:51,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {16188#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16184#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:25:51,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {16192#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16188#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:25:51,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {16196#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16192#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {16200#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16196#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:25:51,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {16204#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16200#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:25:51,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {16208#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16204#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:25:51,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {16212#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16208#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:25:51,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {16216#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16212#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:25:51,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {16220#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16216#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {16224#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16220#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {16228#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16224#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:25:51,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {16232#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16228#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {16236#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16232#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:25:51,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {16240#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16236#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:25:51,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {16244#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16240#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:25:51,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {16248#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16244#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:25:51,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {16252#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16248#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:25:51,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {16256#(< 38 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16252#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:25:51,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {16256#(< 38 ~SIZE~0)} call #t~ret4 := main(); {16256#(< 38 ~SIZE~0)} is VALID [2022-04-08 10:25:51,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16256#(< 38 ~SIZE~0)} {15899#true} #45#return; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-08 10:25:51,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {16256#(< 38 ~SIZE~0)} assume true; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-08 10:25:51,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {15899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16256#(< 38 ~SIZE~0)} is VALID [2022-04-08 10:25:51,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {15899#true} call ULTIMATE.init(); {15899#true} is VALID [2022-04-08 10:25:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:25:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588833102] [2022-04-08 10:25:51,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:25:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072316842] [2022-04-08 10:25:51,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072316842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:25:51,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:25:51,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2022-04-08 10:25:51,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479864964] [2022-04-08 10:25:51,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479864964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:51,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:51,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 10:25:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266365350] [2022-04-08 10:25:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-08 10:25:51,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:51,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-04-08 10:25:51,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:51,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 10:25:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 10:25:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:25:51,730 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-04-08 10:25:56,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:26:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:02,391 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 10:26:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 10:26:02,391 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-08 10:26:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-04-08 10:26:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-08 10:26:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-04-08 10:26:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-08 10:26:02,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-08 10:26:02,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:02,445 INFO L225 Difference]: With dead ends: 56 [2022-04-08 10:26:02,445 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:26:02,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:26:02,446 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:02,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:26:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:26:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 10:26:02,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:02,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-04-08 10:26:02,480 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-04-08 10:26:02,480 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-04-08 10:26:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:02,481 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 10:26:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 10:26:02,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:02,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:02,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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) Second operand 51 states. [2022-04-08 10:26:02,481 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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) Second operand 51 states. [2022-04-08 10:26:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:02,482 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 10:26:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 10:26:02,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:02,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:02,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:02,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-04-08 10:26:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-08 10:26:02,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-08 10:26:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:02,483 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-08 10:26:02,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-04-08 10:26:02,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-08 10:26:02,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 10:26:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:26:02,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:02,540 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:02,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:26:02,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:26:02,741 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash -229103758, now seen corresponding path program 77 times [2022-04-08 10:26:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:02,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643113090] [2022-04-08 10:26:02,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:02,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -229103758, now seen corresponding path program 78 times [2022-04-08 10:26:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:02,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897061287] [2022-04-08 10:26:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:02,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:26:02,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066264241] [2022-04-08 10:26:02,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:26:02,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:02,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:02,761 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:26:02,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:26:02,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-08 10:26:02,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:02,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:26:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:02,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:04,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {16590#true} call ULTIMATE.init(); {16590#true} is VALID [2022-04-08 10:26:04,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {16590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:04,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {16598#(<= 40000 ~SIZE~0)} assume true; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:04,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16598#(<= 40000 ~SIZE~0)} {16590#true} #45#return; {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:04,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {16598#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {16598#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:04,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {16598#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16611#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {16611#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16615#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {16615#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:26:04,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {16619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16623#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:26:04,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {16623#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:26:04,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {16627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16631#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {16631#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16635#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:26:04,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {16635#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16639#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {16639#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16643#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:26:04,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {16643#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:26:04,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {16647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16651#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {16651#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:26:04,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {16655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:26:04,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {16659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16663#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {16663#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16667#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {16667#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16671#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {16671#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16675#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {16675#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:26:04,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {16679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16683#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {16683#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:26:04,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {16687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:26:04,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {16691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16695#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {16695#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:26:04,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {16699#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16703#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:26:04,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {16703#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:26:04,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {16707#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:26:04,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {16711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16715#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:26:04,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {16715#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16719#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {16719#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:26:04,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {16723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16727#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:26:04,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {16727#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16731#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {16731#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16735#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16739#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {16739#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:26:04,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {16743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:26:04,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {16747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:26:04,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {16751#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:26:04,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {16755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:26:04,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {16759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16763#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:04,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {16763#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:26:04,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {16767#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !(~i~0 < ~SIZE~0); {16591#false} is VALID [2022-04-08 10:26:04,117 INFO L272 TraceCheckUtils]: 46: Hoare triple {16591#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {16591#false} is VALID [2022-04-08 10:26:04,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {16591#false} ~cond := #in~cond; {16591#false} is VALID [2022-04-08 10:26:04,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {16591#false} assume 0 == ~cond; {16591#false} is VALID [2022-04-08 10:26:04,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {16591#false} assume !false; {16591#false} is VALID [2022-04-08 10:26:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:04,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:17,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {16591#false} assume !false; {16591#false} is VALID [2022-04-08 10:26:17,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {16591#false} assume 0 == ~cond; {16591#false} is VALID [2022-04-08 10:26:17,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {16591#false} ~cond := #in~cond; {16591#false} is VALID [2022-04-08 10:26:17,612 INFO L272 TraceCheckUtils]: 46: Hoare triple {16591#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {16591#false} is VALID [2022-04-08 10:26:17,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {16795#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {16591#false} is VALID [2022-04-08 10:26:17,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {16799#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16795#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:26:17,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {16803#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16799#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:26:17,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {16807#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16803#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:26:17,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {16811#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16807#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:26:17,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {16815#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16811#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:26:17,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {16819#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16815#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {16823#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16819#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:26:17,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {16827#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16823#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {16831#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16827#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:26:17,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {16835#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16831#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:26:17,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {16839#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16835#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:26:17,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {16843#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16839#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:26:17,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {16847#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16843#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:26:17,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {16851#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16847#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:26:17,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {16855#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16851#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:26:17,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {16859#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16855#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:26:17,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {16863#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16859#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:26:17,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16863#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:26:17,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {16871#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16867#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:26:17,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16871#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {16879#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16875#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:26:17,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {16883#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16879#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:26:17,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {16887#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16883#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:26:17,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {16891#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16887#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {16895#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16891#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:26:17,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {16899#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16895#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:26:17,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {16903#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16899#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:26:17,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {16907#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16903#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:26:17,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {16911#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16907#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:26:17,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {16915#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16911#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {16919#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16915#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {16923#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16919#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:26:17,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {16927#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16923#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {16931#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16927#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:26:17,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {16935#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16931#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:26:17,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {16939#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16935#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:17,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {16943#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16939#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:26:17,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {16947#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16943#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:26:17,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {16951#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {16947#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:26:17,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {16955#(< 39 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {16951#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:26:17,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {16955#(< 39 ~SIZE~0)} call #t~ret4 := main(); {16955#(< 39 ~SIZE~0)} is VALID [2022-04-08 10:26:17,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16955#(< 39 ~SIZE~0)} {16590#true} #45#return; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-08 10:26:17,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {16955#(< 39 ~SIZE~0)} assume true; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-08 10:26:17,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {16590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {16955#(< 39 ~SIZE~0)} is VALID [2022-04-08 10:26:17,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {16590#true} call ULTIMATE.init(); {16590#true} is VALID [2022-04-08 10:26:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:17,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897061287] [2022-04-08 10:26:17,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:26:17,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066264241] [2022-04-08 10:26:17,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066264241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:26:17,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:17,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 84 [2022-04-08 10:26:17,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:17,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643113090] [2022-04-08 10:26:17,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643113090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:17,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:17,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 10:26:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336671407] [2022-04-08 10:26:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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 50 [2022-04-08 10:26:17,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:17,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-04-08 10:26:17,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:17,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 10:26:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 10:26:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2022-04-08 10:26:17,697 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-04-08 10:26:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:24,218 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 10:26:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 10:26:24,218 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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 50 [2022-04-08 10:26:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-04-08 10:26:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-08 10:26:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-04-08 10:26:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-08 10:26:24,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-08 10:26:24,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:24,273 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:26:24,273 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 10:26:24,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2022-04-08 10:26:24,275 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:24,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:26:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 10:26:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 10:26:24,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:24,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-04-08 10:26:24,310 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-04-08 10:26:24,310 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-04-08 10:26:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:24,311 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 10:26:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 10:26:24,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:24,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:24,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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) Second operand 52 states. [2022-04-08 10:26:24,311 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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) Second operand 52 states. [2022-04-08 10:26:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:24,312 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 10:26:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 10:26:24,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:24,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:24,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:24,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-04-08 10:26:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-08 10:26:24,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-08 10:26:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:24,313 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-08 10:26:24,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-04-08 10:26:24,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-08 10:26:24,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 10:26:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:26:24,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:24,358 INFO L499 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:24,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:26:24,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:26:24,574 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1522213163, now seen corresponding path program 79 times [2022-04-08 10:26:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:24,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776831756] [2022-04-08 10:26:24,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:24,576 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1522213163, now seen corresponding path program 80 times [2022-04-08 10:26:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:24,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475635592] [2022-04-08 10:26:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:24,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:26:24,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055233082] [2022-04-08 10:26:24,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:24,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:24,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:24,592 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:26:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:26:24,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:24,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:24,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:26:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:24,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:25,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {17295#true} call ULTIMATE.init(); {17295#true} is VALID [2022-04-08 10:26:25,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {17295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:25,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {17303#(<= 40000 ~SIZE~0)} assume true; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:25,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17303#(<= 40000 ~SIZE~0)} {17295#true} #45#return; {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:25,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {17303#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {17303#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:25,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {17303#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {17316#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {17316#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17320#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {17320#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:26:25,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {17324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:26:25,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {17328#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:26:25,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {17332#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17336#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {17336#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:26:25,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {17340#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17344#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {17344#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17348#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:26:25,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {17348#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:26:25,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {17352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17356#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {17356#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17360#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:26:25,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {17360#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:26:25,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {17364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17368#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {17368#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17372#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {17372#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17376#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {17376#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17380#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {17380#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:26:25,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {17384#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17388#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {17388#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:26:25,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {17392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:26:25,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {17396#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17400#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {17400#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17404#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:26:25,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {17404#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:26:25,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {17408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:26:25,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {17412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:26:25,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {17416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:26:25,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {17420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17424#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {17424#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:26:25,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {17428#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:26:25,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {17432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17436#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {17436#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17440#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {17440#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17444#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {17444#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:26:25,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {17448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:26:25,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {17452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17456#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:26:25,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {17456#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17460#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:26:25,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17464#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:26:25,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {17464#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17468#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:25,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {17468#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:26:25,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {17472#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:26:25,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {17476#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !(~i~0 < ~SIZE~0); {17296#false} is VALID [2022-04-08 10:26:25,875 INFO L272 TraceCheckUtils]: 47: Hoare triple {17296#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {17296#false} is VALID [2022-04-08 10:26:25,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {17296#false} ~cond := #in~cond; {17296#false} is VALID [2022-04-08 10:26:25,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {17296#false} assume 0 == ~cond; {17296#false} is VALID [2022-04-08 10:26:25,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {17296#false} assume !false; {17296#false} is VALID [2022-04-08 10:26:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:25,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:47,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {17296#false} assume !false; {17296#false} is VALID [2022-04-08 10:26:47,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {17296#false} assume 0 == ~cond; {17296#false} is VALID [2022-04-08 10:26:47,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {17296#false} ~cond := #in~cond; {17296#false} is VALID [2022-04-08 10:26:47,690 INFO L272 TraceCheckUtils]: 47: Hoare triple {17296#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {17296#false} is VALID [2022-04-08 10:26:47,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {17504#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {17296#false} is VALID [2022-04-08 10:26:47,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {17508#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17504#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:26:47,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {17512#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17508#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:26:47,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {17516#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17512#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:26:47,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {17520#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17516#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:26:47,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {17524#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17520#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:26:47,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {17528#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17524#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {17532#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17528#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:26:47,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {17536#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17532#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {17540#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17536#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:26:47,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {17544#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17540#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:26:47,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {17548#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17544#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:26:47,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {17552#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17548#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:26:47,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {17556#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17552#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:26:47,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {17560#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17556#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:26:47,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {17564#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17560#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:26:47,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {17568#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17564#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:26:47,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {17572#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17568#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:26:47,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {17576#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17572#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:26:47,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {17580#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17576#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:26:47,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {17584#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17580#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {17588#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17584#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:26:47,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {17592#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17588#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:26:47,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {17596#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17592#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:26:47,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {17600#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17596#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17600#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:26:47,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {17608#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17604#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:26:47,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {17612#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17608#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:26:47,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {17616#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17612#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:26:47,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {17620#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17616#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:26:47,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {17624#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17620#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {17628#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17624#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {17632#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17628#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:26:47,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {17636#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17632#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {17640#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17636#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:26:47,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {17644#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17640#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:26:47,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {17648#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17644#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {17652#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17648#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:26:47,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {17656#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17652#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:26:47,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {17660#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17656#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:26:47,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {17664#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {17660#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:26:47,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {17668#(< 40 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {17664#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:26:47,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {17668#(< 40 ~SIZE~0)} call #t~ret4 := main(); {17668#(< 40 ~SIZE~0)} is VALID [2022-04-08 10:26:47,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17668#(< 40 ~SIZE~0)} {17295#true} #45#return; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-08 10:26:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {17668#(< 40 ~SIZE~0)} assume true; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-08 10:26:47,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {17295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {17668#(< 40 ~SIZE~0)} is VALID [2022-04-08 10:26:47,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {17295#true} call ULTIMATE.init(); {17295#true} is VALID [2022-04-08 10:26:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475635592] [2022-04-08 10:26:47,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:26:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055233082] [2022-04-08 10:26:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055233082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:26:47,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2022-04-08 10:26:47,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:47,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776831756] [2022-04-08 10:26:47,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776831756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:47,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:47,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 10:26:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405792945] [2022-04-08 10:26:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-08 10:26:47,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:47,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-04-08 10:26:47,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:47,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 10:26:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 10:26:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 10:26:47,787 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-04-08 10:26:52,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:26:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:54,206 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 10:26:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 10:26:54,206 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-08 10:26:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-04-08 10:26:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-08 10:26:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-04-08 10:26:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-08 10:26:54,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-08 10:26:54,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:54,264 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:26:54,264 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 10:26:54,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 10:26:54,267 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:54,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:26:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 10:26:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 10:26:54,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:54,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-04-08 10:26:54,304 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-04-08 10:26:54,304 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-04-08 10:26:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:54,304 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 10:26:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 10:26:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:54,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:54,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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) Second operand 53 states. [2022-04-08 10:26:54,305 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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) Second operand 53 states. [2022-04-08 10:26:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:54,305 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 10:26:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 10:26:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:54,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:54,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:54,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-04-08 10:26:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-08 10:26:54,306 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-08 10:26:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:54,306 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-08 10:26:54,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-04-08 10:26:54,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-08 10:26:54,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-08 10:26:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 10:26:54,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:54,351 INFO L499 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:54,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:26:54,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:54,564 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash -21537134, now seen corresponding path program 81 times [2022-04-08 10:26:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:54,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033627902] [2022-04-08 10:26:54,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:54,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -21537134, now seen corresponding path program 82 times [2022-04-08 10:26:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:54,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022576238] [2022-04-08 10:26:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:54,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:26:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103580354] [2022-04-08 10:26:54,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:26:54,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:54,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:54,590 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:26:54,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:26:54,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:26:54,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:54,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:26:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:54,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:55,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} call ULTIMATE.init(); {18014#true} is VALID [2022-04-08 10:26:55,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:55,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {18022#(<= 40000 ~SIZE~0)} assume true; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:55,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18022#(<= 40000 ~SIZE~0)} {18014#true} #45#return; {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:55,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {18022#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {18022#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:26:55,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {18022#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18035#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {18035#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18039#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {18039#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:26:55,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {18043#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:26:55,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {18047#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18051#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:26:55,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {18051#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18055#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {18055#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:26:55,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {18059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18063#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {18063#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:26:55,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {18067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:26:55,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {18071#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18075#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {18075#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18079#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:26:55,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {18079#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:26:55,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {18083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18087#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {18087#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18091#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18095#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {18095#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18099#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {18099#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18103#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:26:55,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {18103#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18107#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {18107#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18111#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:26:55,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18115#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:26:55,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {18115#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18119#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {18119#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18123#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:26:55,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {18123#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:26:55,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {18127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:26:55,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {18131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18135#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:26:55,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {18135#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:26:55,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {18139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18143#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {18143#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:26:55,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {18147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:26:55,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {18151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18155#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {18155#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18159#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {18159#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18163#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {18163#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:26:55,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {18167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18171#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:26:55,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {18171#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18175#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:26:55,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {18175#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18179#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:26:55,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {18179#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:26:55,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {18183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18187#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {18187#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:26:55,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {18191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:26:55,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {18195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18199#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:26:55,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {18199#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {18015#false} is VALID [2022-04-08 10:26:55,929 INFO L272 TraceCheckUtils]: 48: Hoare triple {18015#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18015#false} is VALID [2022-04-08 10:26:55,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {18015#false} ~cond := #in~cond; {18015#false} is VALID [2022-04-08 10:26:55,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {18015#false} assume 0 == ~cond; {18015#false} is VALID [2022-04-08 10:26:55,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {18015#false} assume !false; {18015#false} is VALID [2022-04-08 10:26:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:55,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:27:31,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {18015#false} assume !false; {18015#false} is VALID [2022-04-08 10:27:31,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {18015#false} assume 0 == ~cond; {18015#false} is VALID [2022-04-08 10:27:31,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {18015#false} ~cond := #in~cond; {18015#false} is VALID [2022-04-08 10:27:31,334 INFO L272 TraceCheckUtils]: 48: Hoare triple {18015#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18015#false} is VALID [2022-04-08 10:27:31,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {18227#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {18015#false} is VALID [2022-04-08 10:27:31,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {18231#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18227#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:27:31,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {18235#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18231#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:27:31,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {18239#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18235#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:27:31,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {18243#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18239#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:27:31,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {18247#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18243#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:27:31,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {18251#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18247#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {18255#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18251#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:27:31,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {18259#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18255#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {18263#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18259#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:27:31,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {18267#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18263#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:27:31,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {18271#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18267#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:27:31,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {18275#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18271#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:27:31,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {18279#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18275#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:27:31,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {18283#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18279#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:27:31,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {18287#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18283#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:27:31,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {18291#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18287#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:27:31,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {18295#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18291#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:27:31,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {18299#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18295#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:27:31,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {18303#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18299#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:27:31,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {18307#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18303#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {18311#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18307#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:27:31,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {18315#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18311#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:27:31,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {18319#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18315#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:27:31,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {18323#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18319#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {18327#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18323#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:27:31,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {18331#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18327#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:27:31,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {18335#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18331#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:27:31,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {18339#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18335#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:27:31,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {18343#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18339#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:27:31,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {18347#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18343#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {18351#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18347#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {18355#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18351#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:27:31,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {18359#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18355#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {18363#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18359#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:27:31,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {18367#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18363#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:27:31,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {18371#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18367#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {18375#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18371#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:27:31,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {18379#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18375#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:27:31,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {18383#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18379#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:27:31,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {18387#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18383#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:27:31,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {18391#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18387#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {18395#(< 41 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18391#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:27:31,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {18395#(< 41 ~SIZE~0)} call #t~ret4 := main(); {18395#(< 41 ~SIZE~0)} is VALID [2022-04-08 10:27:31,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18395#(< 41 ~SIZE~0)} {18014#true} #45#return; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-08 10:27:31,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {18395#(< 41 ~SIZE~0)} assume true; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-08 10:27:31,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18395#(< 41 ~SIZE~0)} is VALID [2022-04-08 10:27:31,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} call ULTIMATE.init(); {18014#true} is VALID [2022-04-08 10:27:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:31,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022576238] [2022-04-08 10:27:31,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:27:31,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103580354] [2022-04-08 10:27:31,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103580354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:27:31,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:27:31,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 88 [2022-04-08 10:27:31,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:31,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033627902] [2022-04-08 10:27:31,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033627902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:31,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:31,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-08 10:27:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128537796] [2022-04-08 10:27:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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 52 [2022-04-08 10:27:31,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:31,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-04-08 10:27:31,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:31,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-08 10:27:31,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-08 10:27:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:27:31,438 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-04-08 10:27:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:40,871 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-08 10:27:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-08 10:27:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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 52 [2022-04-08 10:27:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-04-08 10:27:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-08 10:27:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-04-08 10:27:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-08 10:27:40,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-08 10:27:40,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:40,955 INFO L225 Difference]: With dead ends: 59 [2022-04-08 10:27:40,955 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 10:27:40,956 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:27:40,956 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:40,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:27:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 10:27:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 10:27:40,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:40,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-04-08 10:27:40,999 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-04-08 10:27:40,999 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-04-08 10:27:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:41,000 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 10:27:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 10:27:41,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:41,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:41,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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) Second operand 54 states. [2022-04-08 10:27:41,000 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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) Second operand 54 states. [2022-04-08 10:27:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:41,001 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 10:27:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 10:27:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:41,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:41,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-04-08 10:27:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-08 10:27:41,001 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-08 10:27:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:41,002 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-08 10:27:41,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-04-08 10:27:41,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-08 10:27:41,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 10:27:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 10:27:41,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:41,070 INFO L499 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:41,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 10:27:41,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:41,271 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -633156085, now seen corresponding path program 83 times [2022-04-08 10:27:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438461972] [2022-04-08 10:27:41,273 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:27:41,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:27:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -633156085, now seen corresponding path program 84 times [2022-04-08 10:27:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:41,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180819667] [2022-04-08 10:27:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:41,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:27:41,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525858900] [2022-04-08 10:27:41,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:27:41,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:41,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:27:41,293 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:27:41,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:27:41,359 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-08 10:27:41,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:27:41,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:27:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:27:42,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {18747#true} call ULTIMATE.init(); {18747#true} is VALID [2022-04-08 10:27:42,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {18747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:27:42,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {18755#(<= 40000 ~SIZE~0)} assume true; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:27:42,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18755#(<= 40000 ~SIZE~0)} {18747#true} #45#return; {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:27:42,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {18755#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {18755#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:27:42,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {18755#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {18768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {18768#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {18772#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:27:42,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {18776#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:27:42,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {18780#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:27:42,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {18784#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {18788#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:27:42,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {18792#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {18796#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:27:42,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {18800#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:27:42,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {18804#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {18808#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:27:42,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {18812#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:27:42,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {18816#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {18820#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {18824#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {18828#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {18832#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:27:42,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {18836#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {18840#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:27:42,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {18844#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:27:42,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {18848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {18852#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:27:42,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {18856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:27:42,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {18860#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:27:42,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {18864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:27:42,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {18868#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:27:42,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {18872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18876#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {18876#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:27:42,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {18880#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:27:42,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {18884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18888#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {18888#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18892#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {18892#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18896#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {18896#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:27:42,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {18900#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:27:42,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {18904#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:27:42,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {18908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:27:42,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {18912#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:27:42,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {18916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18920#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {18920#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:27:42,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {18924#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:27:42,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {18928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18932#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:27:42,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {18932#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:27:42,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {18936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !(~i~0 < ~SIZE~0); {18748#false} is VALID [2022-04-08 10:27:42,730 INFO L272 TraceCheckUtils]: 49: Hoare triple {18748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18748#false} is VALID [2022-04-08 10:27:42,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {18748#false} ~cond := #in~cond; {18748#false} is VALID [2022-04-08 10:27:42,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {18748#false} assume 0 == ~cond; {18748#false} is VALID [2022-04-08 10:27:42,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {18748#false} assume !false; {18748#false} is VALID [2022-04-08 10:27:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:42,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:28:27,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {18748#false} assume !false; {18748#false} is VALID [2022-04-08 10:28:27,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {18748#false} assume 0 == ~cond; {18748#false} is VALID [2022-04-08 10:28:27,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {18748#false} ~cond := #in~cond; {18748#false} is VALID [2022-04-08 10:28:27,347 INFO L272 TraceCheckUtils]: 49: Hoare triple {18748#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {18748#false} is VALID [2022-04-08 10:28:27,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {18964#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {18748#false} is VALID [2022-04-08 10:28:27,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {18968#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18964#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:28:27,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {18972#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18968#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:28:27,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {18976#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18972#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:28:27,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {18980#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18976#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:28:27,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {18984#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18980#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:28:27,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {18988#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18984#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {18992#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18988#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:28:27,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {18996#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18992#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {19000#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {18996#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:28:27,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {19004#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19000#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:28:27,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {19008#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19004#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:28:27,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {19012#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19008#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:28:27,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {19016#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19012#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:28:27,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {19020#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19016#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:28:27,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {19024#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19020#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:28:27,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {19028#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19024#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:28:27,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {19032#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19028#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:28:27,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {19036#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19032#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:28:27,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {19040#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19036#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:28:27,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {19044#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19040#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {19048#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19044#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:28:27,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {19052#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19048#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:28:27,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {19056#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19052#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:28:27,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {19060#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19056#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {19064#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19060#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:28:27,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {19068#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19064#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:28:27,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {19072#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19068#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:28:27,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {19076#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19072#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:28:27,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {19080#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19076#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:28:27,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {19084#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19080#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {19088#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19084#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {19092#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19088#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:28:27,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {19096#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19092#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {19100#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19096#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:28:27,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {19104#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19100#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:28:27,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {19108#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19104#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {19112#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19108#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:28:27,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {19116#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19112#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:28:27,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {19120#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19116#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:28:27,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {19124#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19120#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:28:27,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {19128#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19124#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {19132#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19128#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {19136#(< 42 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19132#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:28:27,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {19136#(< 42 ~SIZE~0)} call #t~ret4 := main(); {19136#(< 42 ~SIZE~0)} is VALID [2022-04-08 10:28:27,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19136#(< 42 ~SIZE~0)} {18747#true} #45#return; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-08 10:28:27,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {19136#(< 42 ~SIZE~0)} assume true; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-08 10:28:27,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {18747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19136#(< 42 ~SIZE~0)} is VALID [2022-04-08 10:28:27,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {18747#true} call ULTIMATE.init(); {18747#true} is VALID [2022-04-08 10:28:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:28:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180819667] [2022-04-08 10:28:27,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:28:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525858900] [2022-04-08 10:28:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525858900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:28:27,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:28:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 90 [2022-04-08 10:28:27,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:28:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438461972] [2022-04-08 10:28:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438461972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:28:27,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:28:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-08 10:28:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406831359] [2022-04-08 10:28:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:28:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-08 10:28:27,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:28:27,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-04-08 10:28:27,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:27,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-08 10:28:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-08 10:28:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2022-04-08 10:28:27,497 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-04-08 10:28:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:36,350 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-08 10:28:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-08 10:28:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-08 10:28:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:28:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-04-08 10:28:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-08 10:28:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-04-08 10:28:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-08 10:28:36,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-08 10:28:36,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:36,450 INFO L225 Difference]: With dead ends: 60 [2022-04-08 10:28:36,450 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 10:28:36,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2022-04-08 10:28:36,451 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:28:36,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:28:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 10:28:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 10:28:36,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:28:36,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-04-08 10:28:36,495 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-04-08 10:28:36,495 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-04-08 10:28:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:36,496 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 10:28:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 10:28:36,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:36,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:36,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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) Second operand 55 states. [2022-04-08 10:28:36,496 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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) Second operand 55 states. [2022-04-08 10:28:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:36,498 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 10:28:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 10:28:36,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:36,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:36,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:28:36,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:28:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-04-08 10:28:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-08 10:28:36,499 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-08 10:28:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:28:36,499 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-08 10:28:36,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-04-08 10:28:36,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-08 10:28:36,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-08 10:28:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 10:28:36,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:28:36,575 INFO L499 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:28:36,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 10:28:36,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-08 10:28:36,776 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:28:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:28:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492914, now seen corresponding path program 85 times [2022-04-08 10:28:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [858531336] [2022-04-08 10:28:36,779 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:28:36,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:28:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492914, now seen corresponding path program 86 times [2022-04-08 10:28:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:28:36,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765181923] [2022-04-08 10:28:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:28:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:28:36,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:28:36,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769364272] [2022-04-08 10:28:36,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:28:36,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:28:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:28:36,797 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:28:36,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:28:36,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:28:36,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:28:36,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-08 10:28:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:36,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:28:38,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {19494#true} call ULTIMATE.init(); {19494#true} is VALID [2022-04-08 10:28:38,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:28:38,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {19502#(<= 40000 ~SIZE~0)} assume true; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:28:38,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19502#(<= 40000 ~SIZE~0)} {19494#true} #45#return; {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:28:38,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {19502#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {19502#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:28:38,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {19502#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19515#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {19515#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19519#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {19519#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:28:38,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {19523#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:28:38,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {19527#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19531#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:28:38,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {19531#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19535#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {19535#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19539#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:28:38,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19543#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {19543#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19547#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:28:38,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {19547#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:28:38,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {19551#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19555#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {19555#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19559#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:28:38,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {19559#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:28:38,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {19563#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19567#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {19567#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19571#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {19571#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19575#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {19575#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19579#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {19579#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19583#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:28:38,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {19583#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19587#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {19587#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:28:38,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {19591#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19595#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:28:38,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {19595#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19599#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {19599#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19603#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:28:38,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {19603#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19607#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:28:38,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {19607#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19611#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:28:38,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {19611#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19615#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:28:38,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {19615#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:28:38,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {19619#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19623#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {19623#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:28:38,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {19627#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19631#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:28:38,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {19631#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19635#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {19635#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19639#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {19639#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19643#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {19643#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:28:38,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {19647#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:28:38,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {19651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:28:38,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {19655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:28:38,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {19659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19663#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:28:38,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {19663#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19667#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {19667#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19671#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:28:38,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {19671#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:28:38,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {19675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19679#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:28:38,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {19679#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:28:38,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {19683#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-08 10:28:38,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {19687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !(~i~0 < ~SIZE~0); {19495#false} is VALID [2022-04-08 10:28:38,274 INFO L272 TraceCheckUtils]: 50: Hoare triple {19495#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {19495#false} is VALID [2022-04-08 10:28:38,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} ~cond := #in~cond; {19495#false} is VALID [2022-04-08 10:28:38,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {19495#false} assume 0 == ~cond; {19495#false} is VALID [2022-04-08 10:28:38,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-04-08 10:28:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:38,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:42,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-04-08 10:29:42,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {19495#false} assume 0 == ~cond; {19495#false} is VALID [2022-04-08 10:29:42,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} ~cond := #in~cond; {19495#false} is VALID [2022-04-08 10:29:42,087 INFO L272 TraceCheckUtils]: 50: Hoare triple {19495#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {19495#false} is VALID [2022-04-08 10:29:42,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {19715#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {19495#false} is VALID [2022-04-08 10:29:42,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {19719#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19715#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:29:42,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {19723#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19719#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:29:42,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {19727#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19723#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:29:42,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {19731#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19727#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:29:42,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {19735#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19731#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:29:42,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {19739#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19735#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {19743#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19739#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:29:42,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {19747#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19743#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {19751#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19747#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:29:42,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {19755#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19751#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:29:42,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {19759#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19755#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:29:42,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {19763#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19759#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:29:42,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {19767#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19763#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:29:42,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {19771#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19767#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:29:42,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {19775#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19771#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:29:42,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {19779#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19775#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:29:42,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {19783#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19779#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:29:42,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {19787#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19783#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:29:42,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {19791#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19787#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:29:42,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {19795#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19791#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {19799#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19795#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:29:42,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {19803#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19799#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:29:42,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {19807#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19803#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:29:42,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {19811#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19807#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {19815#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19811#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:29:42,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {19819#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19815#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:29:42,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {19823#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19819#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:29:42,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {19827#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19823#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:29:42,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {19831#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19827#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:29:42,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {19835#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19831#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {19839#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19835#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {19843#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19839#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:29:42,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {19847#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19843#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {19851#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19847#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:29:42,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {19855#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19851#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:29:42,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {19859#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19855#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {19863#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19859#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:29:42,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {19867#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19863#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:29:42,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {19871#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19867#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:29:42,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {19875#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19871#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:29:42,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {19879#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19875#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {19883#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19879#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {19887#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {19883#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:29:42,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {19891#(< 43 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {19887#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-08 10:29:42,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {19891#(< 43 ~SIZE~0)} call #t~ret4 := main(); {19891#(< 43 ~SIZE~0)} is VALID [2022-04-08 10:29:42,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19891#(< 43 ~SIZE~0)} {19494#true} #45#return; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-08 10:29:42,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {19891#(< 43 ~SIZE~0)} assume true; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-08 10:29:42,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {19891#(< 43 ~SIZE~0)} is VALID [2022-04-08 10:29:42,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {19494#true} call ULTIMATE.init(); {19494#true} is VALID [2022-04-08 10:29:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765181923] [2022-04-08 10:29:42,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769364272] [2022-04-08 10:29:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769364272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:42,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:42,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2022-04-08 10:29:42,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:42,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [858531336] [2022-04-08 10:29:42,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [858531336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:42,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:42,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-08 10:29:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43855866] [2022-04-08 10:29:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:42,155 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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 54 [2022-04-08 10:29:42,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:42,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-04-08 10:29:42,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:42,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-08 10:29:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-08 10:29:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2022-04-08 10:29:42,216 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-04-08 10:29:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:52,888 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-08 10:29:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-08 10:29:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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 54 [2022-04-08 10:29:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-04-08 10:29:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-08 10:29:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-04-08 10:29:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-08 10:29:52,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-08 10:29:52,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:52,994 INFO L225 Difference]: With dead ends: 61 [2022-04-08 10:29:52,994 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 10:29:52,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2022-04-08 10:29:52,995 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:52,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:29:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 10:29:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 10:29:53,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:53,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-04-08 10:29:53,051 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-04-08 10:29:53,051 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-04-08 10:29:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:53,052 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 10:29:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-08 10:29:53,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:53,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:53,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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) Second operand 56 states. [2022-04-08 10:29:53,052 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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) Second operand 56 states. [2022-04-08 10:29:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:53,053 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 10:29:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-08 10:29:53,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:53,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:53,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:53,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-04-08 10:29:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-08 10:29:53,054 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-08 10:29:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:53,054 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-08 10:29:53,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-04-08 10:29:53,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-08 10:29:53,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-08 10:29:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 10:29:53,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:53,148 INFO L499 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:53,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:53,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:53,349 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766741, now seen corresponding path program 87 times [2022-04-08 10:29:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:53,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [148955938] [2022-04-08 10:29:53,351 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:53,351 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766741, now seen corresponding path program 88 times [2022-04-08 10:29:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:53,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382313955] [2022-04-08 10:29:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:53,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:53,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411715687] [2022-04-08 10:29:53,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:29:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:53,369 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:53,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:29:53,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:29:53,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:53,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:29:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:53,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:54,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {20255#true} call ULTIMATE.init(); {20255#true} is VALID [2022-04-08 10:29:54,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {20255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:29:54,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {20263#(<= 40000 ~SIZE~0)} assume true; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:29:54,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20263#(<= 40000 ~SIZE~0)} {20255#true} #45#return; {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:29:54,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {20263#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {20263#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:29:54,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {20263#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {20276#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {20276#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20280#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {20280#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:29:54,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {20284#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:29:54,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {20288#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:29:54,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {20292#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20296#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {20296#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20300#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:29:54,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {20300#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20304#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {20304#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:29:54,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {20308#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:29:54,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {20312#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20316#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {20316#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:29:54,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {20320#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:29:54,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {20324#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20328#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {20328#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20332#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {20332#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20336#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {20336#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20340#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {20340#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:29:54,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {20344#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20348#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {20348#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:29:54,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {20352#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20356#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:29:54,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {20356#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20360#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {20360#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:29:54,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {20364#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20368#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:29:54,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {20368#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:29:54,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {20372#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:29:54,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {20376#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20380#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:29:54,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {20380#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20384#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {20384#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:29:54,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {20388#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:29:54,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {20392#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20396#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20400#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {20400#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20404#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {20404#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:29:54,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {20408#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:29:54,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {20412#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:29:54,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {20416#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:29:54,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {20420#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20424#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:29:54,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {20424#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20428#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {20428#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:29:54,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {20432#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20436#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:29:54,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {20436#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20440#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:29:54,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {20440#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20444#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:29:54,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {20444#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-08 10:29:54,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {20448#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-08 10:29:54,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {20452#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !(~i~0 < ~SIZE~0); {20256#false} is VALID [2022-04-08 10:29:54,881 INFO L272 TraceCheckUtils]: 51: Hoare triple {20256#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {20256#false} is VALID [2022-04-08 10:29:54,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {20256#false} ~cond := #in~cond; {20256#false} is VALID [2022-04-08 10:29:54,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {20256#false} assume 0 == ~cond; {20256#false} is VALID [2022-04-08 10:29:54,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {20256#false} assume !false; {20256#false} is VALID [2022-04-08 10:29:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:54,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:31:05,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {20256#false} assume !false; {20256#false} is VALID [2022-04-08 10:31:05,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {20256#false} assume 0 == ~cond; {20256#false} is VALID [2022-04-08 10:31:05,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {20256#false} ~cond := #in~cond; {20256#false} is VALID [2022-04-08 10:31:05,471 INFO L272 TraceCheckUtils]: 51: Hoare triple {20256#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {20256#false} is VALID [2022-04-08 10:31:05,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {20480#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {20256#false} is VALID [2022-04-08 10:31:05,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {20484#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20480#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:31:05,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {20488#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20484#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:31:05,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {20492#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20488#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:31:05,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {20496#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20492#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:31:05,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {20500#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20496#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:31:05,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {20504#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20500#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {20508#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20504#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:31:05,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {20512#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20508#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {20516#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20512#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:31:05,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {20520#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20516#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:31:05,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {20524#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20520#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:31:05,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {20528#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20524#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:31:05,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {20532#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20528#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:31:05,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {20536#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20532#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:31:05,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {20540#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20536#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:31:05,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {20544#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20540#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:31:05,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {20548#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20544#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:31:05,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {20552#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20548#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:31:05,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {20556#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20552#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:31:05,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {20560#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20556#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {20564#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20560#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:31:05,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {20568#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20564#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:31:05,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {20572#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20568#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:31:05,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {20576#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20572#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {20580#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20576#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:31:05,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {20584#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20580#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:31:05,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {20588#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20584#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:31:05,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {20592#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20588#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:31:05,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {20596#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20592#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:31:05,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {20600#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20596#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {20604#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20600#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {20608#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20604#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:31:05,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {20612#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20608#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {20616#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20612#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:31:05,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {20620#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20616#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:31:05,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {20624#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20620#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {20628#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20624#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:31:05,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {20632#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20628#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:31:05,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {20636#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20632#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:31:05,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {20640#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20636#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:31:05,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {20644#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20640#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {20648#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20644#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {20652#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20648#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {20656#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {20652#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-08 10:31:05,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {20660#(< 44 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {20656#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:31:05,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {20660#(< 44 ~SIZE~0)} call #t~ret4 := main(); {20660#(< 44 ~SIZE~0)} is VALID [2022-04-08 10:31:05,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20660#(< 44 ~SIZE~0)} {20255#true} #45#return; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-08 10:31:05,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {20660#(< 44 ~SIZE~0)} assume true; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-08 10:31:05,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {20255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {20660#(< 44 ~SIZE~0)} is VALID [2022-04-08 10:31:05,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {20255#true} call ULTIMATE.init(); {20255#true} is VALID [2022-04-08 10:31:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382313955] [2022-04-08 10:31:05,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:31:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411715687] [2022-04-08 10:31:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411715687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:31:05,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:31:05,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 94 [2022-04-08 10:31:05,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:05,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [148955938] [2022-04-08 10:31:05,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [148955938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:05,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:05,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-08 10:31:05,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117788804] [2022-04-08 10:31:05,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-08 10:31:05,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:05,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-04-08 10:31:05,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:05,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-08 10:31:05,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-08 10:31:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2022-04-08 10:31:05,600 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-04-08 10:31:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:15,334 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-08 10:31:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-08 10:31:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-08 10:31:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-04-08 10:31:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-08 10:31:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-04-08 10:31:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-08 10:31:15,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-08 10:31:15,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:15,422 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:31:15,422 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:31:15,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 69.5s TimeCoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2022-04-08 10:31:15,423 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:15,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:31:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:31:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 10:31:15,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:15,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-04-08 10:31:15,463 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-04-08 10:31:15,463 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-04-08 10:31:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:15,463 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 10:31:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 10:31:15,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:15,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:15,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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) Second operand 57 states. [2022-04-08 10:31:15,464 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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) Second operand 57 states. [2022-04-08 10:31:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:15,464 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 10:31:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 10:31:15,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:15,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:15,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:15,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-04-08 10:31:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-08 10:31:15,465 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-08 10:31:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:15,465 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-08 10:31:15,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-04-08 10:31:15,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-08 10:31:15,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 10:31:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 10:31:15,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:15,539 INFO L499 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:15,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-08 10:31:15,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 10:31:15,739 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:15,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1037300946, now seen corresponding path program 89 times [2022-04-08 10:31:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:15,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182351387] [2022-04-08 10:31:15,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:31:15,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:31:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1037300946, now seen corresponding path program 90 times [2022-04-08 10:31:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:15,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539409679] [2022-04-08 10:31:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:15,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:31:15,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108807942] [2022-04-08 10:31:15,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:31:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:31:15,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:31:15,760 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:31:15,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:31:15,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-08 10:31:15,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:31:15,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:31:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:15,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:31:17,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {21030#true} call ULTIMATE.init(); {21030#true} is VALID [2022-04-08 10:31:17,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {21030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:31:17,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {21038#(<= 40000 ~SIZE~0)} assume true; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:31:17,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21038#(<= 40000 ~SIZE~0)} {21030#true} #45#return; {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:31:17,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {21038#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {21038#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:31:17,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {21038#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21051#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {21051#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21055#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {21055#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:31:17,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {21059#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:31:17,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {21063#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:31:17,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {21067#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21071#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {21071#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21075#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:31:17,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {21075#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21079#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {21079#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:31:17,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {21083#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21087#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:31:17,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {21087#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21091#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {21091#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21095#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:31:17,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {21095#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21099#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:31:17,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {21099#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21103#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {21103#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21107#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {21107#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21111#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {21111#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21115#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {21115#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21119#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:31:17,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {21119#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21123#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {21123#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:31:17,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {21127#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:31:17,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {21131#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21135#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {21135#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:31:17,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {21139#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21143#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:31:17,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:31:17,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {21147#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:31:17,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21155#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:31:17,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {21155#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21159#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {21159#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21163#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:31:17,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {21163#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:31:17,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {21167#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21171#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {21171#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21175#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {21175#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21179#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {21179#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:31:17,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {21183#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21187#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:31:17,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {21187#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:31:17,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {21191#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:31:17,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {21195#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21199#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:31:17,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {21199#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21203#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {21203#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:31:17,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {21207#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:31:17,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {21211#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21215#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:31:17,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {21215#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:31:17,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {21219#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-08 10:31:17,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {21223#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-08 10:31:17,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {21227#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-08 10:31:17,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {21231#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !(~i~0 < ~SIZE~0); {21031#false} is VALID [2022-04-08 10:31:17,292 INFO L272 TraceCheckUtils]: 52: Hoare triple {21031#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21031#false} is VALID [2022-04-08 10:31:17,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {21031#false} ~cond := #in~cond; {21031#false} is VALID [2022-04-08 10:31:17,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {21031#false} assume 0 == ~cond; {21031#false} is VALID [2022-04-08 10:31:17,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {21031#false} assume !false; {21031#false} is VALID [2022-04-08 10:31:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:17,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:35,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {21031#false} assume !false; {21031#false} is VALID [2022-04-08 10:32:35,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {21031#false} assume 0 == ~cond; {21031#false} is VALID [2022-04-08 10:32:35,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {21031#false} ~cond := #in~cond; {21031#false} is VALID [2022-04-08 10:32:35,774 INFO L272 TraceCheckUtils]: 52: Hoare triple {21031#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21031#false} is VALID [2022-04-08 10:32:35,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {21259#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {21031#false} is VALID [2022-04-08 10:32:35,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {21263#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21259#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:32:35,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {21267#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21263#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:32:35,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {21271#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21267#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:32:35,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {21275#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21271#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:32:35,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {21279#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21275#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:32:35,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {21283#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21279#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {21287#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21283#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:32:35,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {21291#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21287#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {21295#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21291#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:32:35,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {21299#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21295#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:32:35,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {21303#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21299#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:32:35,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {21307#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21303#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:32:35,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {21311#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21307#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:32:35,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {21315#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21311#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:32:35,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {21319#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21315#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:32:35,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {21323#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21319#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:32:35,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {21327#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21323#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:32:35,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {21331#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21327#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:32:35,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {21335#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21331#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:32:35,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {21339#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21335#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {21343#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21339#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:32:35,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {21347#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21343#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:32:35,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {21351#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21347#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:32:35,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {21355#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21351#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {21359#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21355#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:32:35,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {21363#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21359#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:32:35,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {21367#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21363#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:32:35,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {21371#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21367#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:32:35,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {21375#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21371#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:32:35,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {21379#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21375#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {21383#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21379#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {21387#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21383#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:32:35,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {21391#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21387#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {21395#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21391#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:32:35,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {21399#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21395#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:32:35,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {21403#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21399#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {21407#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21403#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:32:35,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {21411#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21407#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:32:35,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {21415#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21411#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:32:35,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {21419#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21415#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:32:35,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {21423#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21419#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {21427#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21423#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {21431#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21427#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {21435#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21431#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-08 10:32:35,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {21439#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21435#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:32:35,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {21443#(< 45 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21439#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-08 10:32:35,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {21443#(< 45 ~SIZE~0)} call #t~ret4 := main(); {21443#(< 45 ~SIZE~0)} is VALID [2022-04-08 10:32:35,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21443#(< 45 ~SIZE~0)} {21030#true} #45#return; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-08 10:32:35,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {21443#(< 45 ~SIZE~0)} assume true; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-08 10:32:35,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {21030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21443#(< 45 ~SIZE~0)} is VALID [2022-04-08 10:32:35,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {21030#true} call ULTIMATE.init(); {21030#true} is VALID [2022-04-08 10:32:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539409679] [2022-04-08 10:32:35,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:32:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108807942] [2022-04-08 10:32:35,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108807942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:35,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:32:35,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2022-04-08 10:32:35,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182351387] [2022-04-08 10:32:35,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182351387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:35,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:35,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-08 10:32:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484438288] [2022-04-08 10:32:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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 56 [2022-04-08 10:32:35,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:35,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-04-08 10:32:35,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:35,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-08 10:32:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-08 10:32:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2022-04-08 10:32:35,910 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-04-08 10:32:42,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:32:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:50,095 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-08 10:32:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-08 10:32:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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 56 [2022-04-08 10:32:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-04-08 10:32:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-08 10:32:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-04-08 10:32:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-08 10:32:50,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-08 10:32:50,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:50,192 INFO L225 Difference]: With dead ends: 63 [2022-04-08 10:32:50,193 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 10:32:50,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 77.3s TimeCoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2022-04-08 10:32:50,194 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:32:50,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 10:32:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 10:32:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 10:32:50,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:50,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-04-08 10:32:50,234 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-04-08 10:32:50,234 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-04-08 10:32:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:50,235 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 10:32:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 10:32:50,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:50,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:50,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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) Second operand 58 states. [2022-04-08 10:32:50,235 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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) Second operand 58 states. [2022-04-08 10:32:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:50,236 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 10:32:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 10:32:50,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:50,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:50,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:50,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-04-08 10:32:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-08 10:32:50,237 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-08 10:32:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:50,237 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-08 10:32:50,237 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-04-08 10:32:50,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-08 10:32:50,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 10:32:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 10:32:50,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:50,321 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:50,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-08 10:32:50,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:50,521 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2126053323, now seen corresponding path program 91 times [2022-04-08 10:32:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:50,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1396113896] [2022-04-08 10:32:50,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:50,525 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2126053323, now seen corresponding path program 92 times [2022-04-08 10:32:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:50,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223529987] [2022-04-08 10:32:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:50,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:32:50,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172116275] [2022-04-08 10:32:50,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:50,544 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:50,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:32:50,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:50,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:50,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:32:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:50,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:52,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {21819#true} call ULTIMATE.init(); {21819#true} is VALID [2022-04-08 10:32:52,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {21819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:32:52,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {21827#(<= 40000 ~SIZE~0)} assume true; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:32:52,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21827#(<= 40000 ~SIZE~0)} {21819#true} #45#return; {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:32:52,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {21827#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {21827#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:32:52,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {21827#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {21840#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {21840#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21844#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {21844#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:32:52,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {21848#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21852#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:32:52,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:32:52,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {21856#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21860#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {21860#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:32:52,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {21864#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21868#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {21868#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:32:52,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {21872#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:32:52,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {21876#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21880#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {21880#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:32:52,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {21884#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:32:52,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {21888#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21892#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {21892#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21896#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {21896#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21900#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {21900#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21904#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {21904#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:32:52,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {21908#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21912#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {21912#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:32:52,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {21916#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:32:52,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {21920#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21924#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {21924#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:32:52,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {21928#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:32:52,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {21932#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:32:52,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {21936#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:32:52,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {21940#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:32:52,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {21944#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21948#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {21948#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:32:52,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {21952#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:32:52,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {21956#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21960#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {21960#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21964#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {21964#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21968#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {21968#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:32:52,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {21972#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:32:52,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {21976#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21980#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:32:52,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {21980#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:32:52,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:32:52,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {21988#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21992#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {21992#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {21996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:32:52,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {21996#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:32:52,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {22000#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22004#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:32:52,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {22004#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:32:52,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {22008#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-08 10:32:52,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {22012#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-08 10:32:52,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {22016#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-08 10:32:52,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {22020#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-08 10:32:52,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {22024#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !(~i~0 < ~SIZE~0); {21820#false} is VALID [2022-04-08 10:32:52,175 INFO L272 TraceCheckUtils]: 53: Hoare triple {21820#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21820#false} is VALID [2022-04-08 10:32:52,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {21820#false} ~cond := #in~cond; {21820#false} is VALID [2022-04-08 10:32:52,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {21820#false} assume 0 == ~cond; {21820#false} is VALID [2022-04-08 10:32:52,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {21820#false} assume !false; {21820#false} is VALID [2022-04-08 10:32:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:52,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:34:19,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {21820#false} assume !false; {21820#false} is VALID [2022-04-08 10:34:19,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {21820#false} assume 0 == ~cond; {21820#false} is VALID [2022-04-08 10:34:19,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {21820#false} ~cond := #in~cond; {21820#false} is VALID [2022-04-08 10:34:19,126 INFO L272 TraceCheckUtils]: 53: Hoare triple {21820#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {21820#false} is VALID [2022-04-08 10:34:19,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {22052#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {21820#false} is VALID [2022-04-08 10:34:19,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {22056#(< (+ main_~i~0 1) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22052#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:34:19,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {22060#(< (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22056#(< (+ main_~i~0 1) ~SIZE~0)} is VALID [2022-04-08 10:34:19,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {22064#(< (+ main_~i~0 3) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22060#(< (+ main_~i~0 2) ~SIZE~0)} is VALID [2022-04-08 10:34:19,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {22068#(< (+ main_~i~0 4) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22064#(< (+ main_~i~0 3) ~SIZE~0)} is VALID [2022-04-08 10:34:19,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {22072#(< (+ 5 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22068#(< (+ main_~i~0 4) ~SIZE~0)} is VALID [2022-04-08 10:34:19,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {22076#(< (+ main_~i~0 6) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22072#(< (+ 5 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {22080#(< (+ 7 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22076#(< (+ main_~i~0 6) ~SIZE~0)} is VALID [2022-04-08 10:34:19,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {22084#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22080#(< (+ 7 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {22088#(< (+ main_~i~0 9) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22084#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:34:19,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {22092#(< (+ main_~i~0 10) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22088#(< (+ main_~i~0 9) ~SIZE~0)} is VALID [2022-04-08 10:34:19,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {22096#(< (+ main_~i~0 11) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22092#(< (+ main_~i~0 10) ~SIZE~0)} is VALID [2022-04-08 10:34:19,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {22100#(< (+ main_~i~0 12) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22096#(< (+ main_~i~0 11) ~SIZE~0)} is VALID [2022-04-08 10:34:19,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {22104#(< (+ main_~i~0 13) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22100#(< (+ main_~i~0 12) ~SIZE~0)} is VALID [2022-04-08 10:34:19,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {22108#(< (+ main_~i~0 14) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22104#(< (+ main_~i~0 13) ~SIZE~0)} is VALID [2022-04-08 10:34:19,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {22112#(< (+ main_~i~0 15) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22108#(< (+ main_~i~0 14) ~SIZE~0)} is VALID [2022-04-08 10:34:19,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {22116#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22112#(< (+ main_~i~0 15) ~SIZE~0)} is VALID [2022-04-08 10:34:19,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {22120#(< (+ main_~i~0 17) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22116#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-08 10:34:19,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {22124#(< (+ main_~i~0 18) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22120#(< (+ main_~i~0 17) ~SIZE~0)} is VALID [2022-04-08 10:34:19,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {22128#(< (+ 19 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22124#(< (+ main_~i~0 18) ~SIZE~0)} is VALID [2022-04-08 10:34:19,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {22132#(< (+ main_~i~0 20) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22128#(< (+ 19 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {22136#(< (+ main_~i~0 21) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22132#(< (+ main_~i~0 20) ~SIZE~0)} is VALID [2022-04-08 10:34:19,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {22140#(< (+ main_~i~0 22) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22136#(< (+ main_~i~0 21) ~SIZE~0)} is VALID [2022-04-08 10:34:19,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {22144#(< (+ 23 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22140#(< (+ main_~i~0 22) ~SIZE~0)} is VALID [2022-04-08 10:34:19,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {22148#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22144#(< (+ 23 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {22152#(< (+ main_~i~0 25) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22148#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-08 10:34:19,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {22156#(< (+ main_~i~0 26) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22152#(< (+ main_~i~0 25) ~SIZE~0)} is VALID [2022-04-08 10:34:19,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {22160#(< (+ main_~i~0 27) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22156#(< (+ main_~i~0 26) ~SIZE~0)} is VALID [2022-04-08 10:34:19,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {22164#(< (+ main_~i~0 28) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22160#(< (+ main_~i~0 27) ~SIZE~0)} is VALID [2022-04-08 10:34:19,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {22168#(< (+ 29 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22164#(< (+ main_~i~0 28) ~SIZE~0)} is VALID [2022-04-08 10:34:19,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {22172#(< (+ 30 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22168#(< (+ 29 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {22176#(< (+ main_~i~0 31) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22172#(< (+ 30 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {22180#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22176#(< (+ main_~i~0 31) ~SIZE~0)} is VALID [2022-04-08 10:34:19,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {22184#(< (+ main_~i~0 33) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22180#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {22188#(< (+ main_~i~0 34) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22184#(< (+ main_~i~0 33) ~SIZE~0)} is VALID [2022-04-08 10:34:19,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {22192#(< (+ 35 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22188#(< (+ main_~i~0 34) ~SIZE~0)} is VALID [2022-04-08 10:34:19,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {22196#(< (+ main_~i~0 36) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22192#(< (+ 35 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {22200#(< (+ main_~i~0 37) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22196#(< (+ main_~i~0 36) ~SIZE~0)} is VALID [2022-04-08 10:34:19,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {22204#(< (+ main_~i~0 38) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22200#(< (+ main_~i~0 37) ~SIZE~0)} is VALID [2022-04-08 10:34:19,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {22208#(< (+ main_~i~0 39) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22204#(< (+ main_~i~0 38) ~SIZE~0)} is VALID [2022-04-08 10:34:19,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {22212#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22208#(< (+ main_~i~0 39) ~SIZE~0)} is VALID [2022-04-08 10:34:19,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {22216#(< (+ 41 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22212#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {22220#(< (+ 42 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22216#(< (+ 41 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {22224#(< (+ main_~i~0 43) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22220#(< (+ 42 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {22228#(< (+ 44 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22224#(< (+ main_~i~0 43) ~SIZE~0)} is VALID [2022-04-08 10:34:19,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {22232#(< (+ main_~i~0 45) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22228#(< (+ 44 main_~i~0) ~SIZE~0)} is VALID [2022-04-08 10:34:19,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {22236#(< (+ main_~i~0 46) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22232#(< (+ main_~i~0 45) ~SIZE~0)} is VALID [2022-04-08 10:34:19,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {22240#(< 46 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {22236#(< (+ main_~i~0 46) ~SIZE~0)} is VALID [2022-04-08 10:34:19,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {22240#(< 46 ~SIZE~0)} call #t~ret4 := main(); {22240#(< 46 ~SIZE~0)} is VALID [2022-04-08 10:34:19,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22240#(< 46 ~SIZE~0)} {21819#true} #45#return; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-08 10:34:19,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {22240#(< 46 ~SIZE~0)} assume true; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-08 10:34:19,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {21819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {22240#(< 46 ~SIZE~0)} is VALID [2022-04-08 10:34:19,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {21819#true} call ULTIMATE.init(); {21819#true} is VALID [2022-04-08 10:34:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:34:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:34:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223529987] [2022-04-08 10:34:19,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:34:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172116275] [2022-04-08 10:34:19,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172116275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:34:19,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:34:19,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-04-08 10:34:19,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:34:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1396113896] [2022-04-08 10:34:19,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1396113896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:34:19,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:34:19,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-08 10:34:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921550712] [2022-04-08 10:34:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:34:19,220 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-08 10:34:19,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:34:19,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04-08 10:34:19,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:19,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-08 10:34:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:34:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-08 10:34:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4659, Invalid=4847, Unknown=0, NotChecked=0, Total=9506 [2022-04-08 10:34:19,292 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04-08 10:34:27,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:34:29,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:34:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:32,440 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-08 10:34:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-08 10:34:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-08 10:34:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:34:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04-08 10:34:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 10:34:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04-08 10:34:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 10:34:32,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 10:34:32,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:32,552 INFO L225 Difference]: With dead ends: 64 [2022-04-08 10:34:32,552 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:34:32,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=4659, Invalid=4847, Unknown=0, NotChecked=0, Total=9506 [2022-04-08 10:34:32,553 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:34:32,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:34:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:34:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 10:34:32,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:34:32,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-04-08 10:34:32,605 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-04-08 10:34:32,605 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-04-08 10:34:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:32,606 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-08 10:34:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 10:34:32,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:32,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:32,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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) Second operand 59 states. [2022-04-08 10:34:32,606 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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) Second operand 59 states. [2022-04-08 10:34:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:32,607 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-08 10:34:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 10:34:32,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:32,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:32,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:34:32,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:34:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-04-08 10:34:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-08 10:34:32,608 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-08 10:34:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:34:32,608 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-08 10:34:32,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04-08 10:34:32,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-08 10:34:32,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-08 10:34:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 10:34:32,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:34:32,700 INFO L499 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:34:32,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 10:34:32,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:32,901 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:34:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:34:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1517638642, now seen corresponding path program 93 times [2022-04-08 10:34:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:34:32,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705635050] [2022-04-08 10:34:32,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:34:32,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:34:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1517638642, now seen corresponding path program 94 times [2022-04-08 10:34:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:34:32,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210228326] [2022-04-08 10:34:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:34:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:34:32,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:34:32,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907809310] [2022-04-08 10:34:32,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:34:32,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:34:32,922 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:34:32,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:34:32,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:34:32,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:34:32,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-08 10:34:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:34:33,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:34:34,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {22622#true} call ULTIMATE.init(); {22622#true} is VALID [2022-04-08 10:34:34,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {22622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:34:34,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {22630#(<= 40000 ~SIZE~0)} assume true; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:34:34,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22630#(<= 40000 ~SIZE~0)} {22622#true} #45#return; {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:34:34,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {22630#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {22630#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 10:34:34,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {22630#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {22643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {22643#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {22647#(and (<= main_~i~0 1) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} is VALID [2022-04-08 10:34:34,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {22651#(and (<= 40000 ~SIZE~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:34:34,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {22655#(and (<= 40000 ~SIZE~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} is VALID [2022-04-08 10:34:34,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {22659#(and (<= 40000 ~SIZE~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {22663#(and (<= main_~i~0 5) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} is VALID [2022-04-08 10:34:34,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {22667#(and (<= 40000 ~SIZE~0) (<= main_~i~0 6))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {22671#(and (<= main_~i~0 7) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} is VALID [2022-04-08 10:34:34,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {22675#(and (<= 40000 ~SIZE~0) (<= main_~i~0 8))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} is VALID [2022-04-08 10:34:34,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {22679#(and (<= 40000 ~SIZE~0) (<= main_~i~0 9))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {22683#(and (<= main_~i~0 10) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} is VALID [2022-04-08 10:34:34,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {22687#(and (<= 40000 ~SIZE~0) (<= main_~i~0 11))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} is VALID [2022-04-08 10:34:34,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {22691#(and (<= 40000 ~SIZE~0) (<= main_~i~0 12))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {22695#(and (<= main_~i~0 13) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {22699#(and (<= main_~i~0 14) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {22703#(and (<= main_~i~0 15) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {22707#(and (<= main_~i~0 16) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} is VALID [2022-04-08 10:34:34,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {22711#(and (<= 40000 ~SIZE~0) (<= main_~i~0 17))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22715#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {22715#(and (<= main_~i~0 18) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} is VALID [2022-04-08 10:34:34,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {22719#(and (<= 40000 ~SIZE~0) (<= main_~i~0 19))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} is VALID [2022-04-08 10:34:34,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {22723#(and (<= 40000 ~SIZE~0) (<= main_~i~0 20))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22727#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {22727#(and (<= main_~i~0 21) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22731#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} is VALID [2022-04-08 10:34:34,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {22731#(and (<= 40000 ~SIZE~0) (<= main_~i~0 22))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22735#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} is VALID [2022-04-08 10:34:34,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {22735#(and (<= 40000 ~SIZE~0) (<= main_~i~0 23))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22739#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} is VALID [2022-04-08 10:34:34,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {22739#(and (<= 40000 ~SIZE~0) (<= main_~i~0 24))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} is VALID [2022-04-08 10:34:34,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {22743#(and (<= 40000 ~SIZE~0) (<= main_~i~0 25))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} is VALID [2022-04-08 10:34:34,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {22747#(and (<= 40000 ~SIZE~0) (<= main_~i~0 26))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22751#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {22751#(and (<= main_~i~0 27) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} is VALID [2022-04-08 10:34:34,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {22755#(and (<= 40000 ~SIZE~0) (<= main_~i~0 28))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} is VALID [2022-04-08 10:34:34,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {22759#(and (<= 40000 ~SIZE~0) (<= main_~i~0 29))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22763#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {22763#(and (<= main_~i~0 30) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22767#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {22767#(and (<= main_~i~0 31) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22771#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {22771#(and (<= main_~i~0 32) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} is VALID [2022-04-08 10:34:34,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {22775#(and (<= 40000 ~SIZE~0) (<= main_~i~0 33))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} is VALID [2022-04-08 10:34:34,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {22779#(and (<= 40000 ~SIZE~0) (<= main_~i~0 34))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22783#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} is VALID [2022-04-08 10:34:34,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {22783#(and (<= 40000 ~SIZE~0) (<= main_~i~0 35))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} is VALID [2022-04-08 10:34:34,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {22787#(and (<= 40000 ~SIZE~0) (<= main_~i~0 36))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} is VALID [2022-04-08 10:34:34,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {22791#(and (<= 40000 ~SIZE~0) (<= main_~i~0 37))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22795#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {22795#(and (<= main_~i~0 38) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22799#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} is VALID [2022-04-08 10:34:34,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {22799#(and (<= 40000 ~SIZE~0) (<= main_~i~0 39))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22803#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} is VALID [2022-04-08 10:34:34,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {22803#(and (<= 40000 ~SIZE~0) (<= main_~i~0 40))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22807#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {22807#(and (<= main_~i~0 41) (<= 40000 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22811#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} is VALID [2022-04-08 10:34:34,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {22811#(and (<= 40000 ~SIZE~0) (<= main_~i~0 42))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22815#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} is VALID [2022-04-08 10:34:34,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {22815#(and (<= 40000 ~SIZE~0) (<= main_~i~0 43))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22819#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} is VALID [2022-04-08 10:34:34,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {22819#(and (<= 40000 ~SIZE~0) (<= main_~i~0 44))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22823#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} is VALID [2022-04-08 10:34:34,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {22823#(and (<= 40000 ~SIZE~0) (<= main_~i~0 45))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22827#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} is VALID [2022-04-08 10:34:34,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {22827#(and (<= 40000 ~SIZE~0) (<= main_~i~0 46))} assume !!(~i~0 < ~SIZE~0);~i~0 := 1 + ~i~0;~sum~0 := ~sum~0 + ~i~0; {22831#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 10:34:34,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {22831#(and (<= main_~i~0 47) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {22623#false} is VALID [2022-04-08 10:34:34,588 INFO L272 TraceCheckUtils]: 54: Hoare triple {22623#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {22623#false} is VALID [2022-04-08 10:34:34,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#false} ~cond := #in~cond; {22623#false} is VALID [2022-04-08 10:34:34,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#false} assume 0 == ~cond; {22623#false} is VALID [2022-04-08 10:34:34,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#false} assume !false; {22623#false} is VALID [2022-04-08 10:34:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:34:34,589 INFO L328 TraceCheckSpWp]: Computing backward predicates...