/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:15:10,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:15:10,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:15:10,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:15:10,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:15:10,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:15:10,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:15:10,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:15:10,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:15:10,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:15:10,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:15:10,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:15:10,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:15:10,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:15:10,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:15:10,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:15:10,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:15:10,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:15:10,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:15:10,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:15:10,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:15:10,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:15:10,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:15:10,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:15:10,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:15:10,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:15:10,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:15:10,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:15:10,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:15:10,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:15:10,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:15:10,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:15:10,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:15:10,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:15:10,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:15:10,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:15:10,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:15:10,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:15:10,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:15:10,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:15:10,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:15:10,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:15:10,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:15:10,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:15:10,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:15:10,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:15:10,952 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:15:10,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:15:10,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:15:10,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:15:10,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:15:10,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:15:10,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:15:10,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:10,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:15:10,955 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:15:10,956 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 04:15:11,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:15:11,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:15:11,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:15:11,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:15:11,232 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:15:11,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-08 04:15:11,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67de6dca/f5bee2bfd996411eb6b097930c83c193/FLAGbfe4f3569 [2022-04-08 04:15:11,673 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:15:11,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-08 04:15:11,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67de6dca/f5bee2bfd996411eb6b097930c83c193/FLAGbfe4f3569 [2022-04-08 04:15:12,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67de6dca/f5bee2bfd996411eb6b097930c83c193 [2022-04-08 04:15:12,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:15:12,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:15:12,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:12,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:15:12,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:15:12,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b51ed88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12, skipping insertion in model container [2022-04-08 04:15:12,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:15:12,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:15:12,297 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/sumt9.c[403,416] [2022-04-08 04:15:12,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:12,344 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:15:12,355 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/sumt9.c[403,416] [2022-04-08 04:15:12,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:12,397 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:15:12,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12 WrapperNode [2022-04-08 04:15:12,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:12,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:15:12,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:15:12,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:15:12,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:15:12,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:15:12,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:15:12,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:15:12,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (1/1) ... [2022-04-08 04:15:12,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:15:12,476 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 04:15:12,499 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 04:15:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:15:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:15:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:15:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:15:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:15:12,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:15:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:15:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:15:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:15:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:15:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:15:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:15:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:15:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:15:12,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:15:12,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:15:23,628 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:15:23,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:15:23,633 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:15:23,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:23 BoogieIcfgContainer [2022-04-08 04:15:23,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:15:23,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:15:23,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:15:23,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:15:23,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:15:12" (1/3) ... [2022-04-08 04:15:23,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c3e49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:23, skipping insertion in model container [2022-04-08 04:15:23,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:12" (2/3) ... [2022-04-08 04:15:23,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c3e49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:23, skipping insertion in model container [2022-04-08 04:15:23,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:23" (3/3) ... [2022-04-08 04:15:23,641 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2022-04-08 04:15:23,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:15:23,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:15:23,681 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:15:23,686 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 04:15:23,687 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:15:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 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 04:15:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:15:23,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:23,708 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:23,708 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 1 times [2022-04-08 04:15:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409077046] [2022-04-08 04:15:23,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:15:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 2 times [2022-04-08 04:15:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960424293] [2022-04-08 04:15:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:15:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:24,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {32#true} is VALID [2022-04-08 04:15:24,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 04:15:24,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-08 04:15:24,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:15:24,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {32#true} is VALID [2022-04-08 04:15:24,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 04:15:24,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-08 04:15:24,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 04:15:24,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:24,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:24,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:24,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:24,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:15:24,634 INFO L272 TraceCheckUtils]: 10: Hoare triple {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:15:24,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:15:24,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-08 04:15:24,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 04:15:24,637 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 04:15:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:15:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960424293] [2022-04-08 04:15:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960424293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:24,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:24,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:15:24,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:15:24,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409077046] [2022-04-08 04:15:24,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409077046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:24,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:24,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:15:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29051564] [2022-04-08 04:15:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:15:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:15:24,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:15:24,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:15:24,674 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 04:15:24,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:15:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:15:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:15:24,699 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:15:27,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:31,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:33,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:35,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:42,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:44,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:46,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:53,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:55,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:57,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:15:59,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:02,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:06,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:08,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:10,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:13,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:13,468 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-08 04:16:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:16:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:16:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 04:16:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 04:16:13,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 04:16:13,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:13,666 INFO L225 Difference]: With dead ends: 67 [2022-04-08 04:16:13,666 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 04:16:13,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:16:13,672 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:13,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 16 Unknown, 0 Unchecked, 33.9s Time] [2022-04-08 04:16:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 04:16:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 04:16:13,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:13,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:13,713 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:13,713 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:13,717 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 04:16:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-08 04:16:13,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:13,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:13,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 04:16:13,719 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 04:16:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:13,724 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 04:16:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-08 04:16:13,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:13,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:13,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:13,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 04:16:13,730 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 04:16:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:13,731 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 04:16:13,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:13,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 04:16:13,792 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 04:16:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 04:16:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:16:13,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:13,794 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:13,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:16:13,794 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 1 times [2022-04-08 04:16:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:13,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469201068] [2022-04-08 04:16:13,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 2 times [2022-04-08 04:16:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:13,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43796249] [2022-04-08 04:16:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:14,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:14,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:16:14,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:16:14,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {323#true} #91#return; {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 04:16:14,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:14,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:16:14,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:16:14,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {323#true} #91#return; {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 04:16:14,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 04:16:14,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {329#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 04:16:14,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {330#(= main_~l~0 0)} is VALID [2022-04-08 04:16:14,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {330#(= main_~l~0 0)} is VALID [2022-04-08 04:16:14,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {330#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {324#false} is VALID [2022-04-08 04:16:14,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {324#false} is VALID [2022-04-08 04:16:14,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#false} ~l~0 := 1 + ~l~0; {324#false} is VALID [2022-04-08 04:16:14,167 INFO L272 TraceCheckUtils]: 11: Hoare triple {324#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {324#false} is VALID [2022-04-08 04:16:14,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 04:16:14,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 04:16:14,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 04:16:14,168 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 04:16:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:14,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43796249] [2022-04-08 04:16:14,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43796249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:14,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:14,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:16:14,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469201068] [2022-04-08 04:16:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469201068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:14,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:14,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:16:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786286806] [2022-04-08 04:16:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:14,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:14,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:16,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:16,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:16:16,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:16:16,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:16:16,348 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:18,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:22,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:27,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:29,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:31,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:35,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:38,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:42,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:44,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:46,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:51,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:16:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:53,493 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-08 04:16:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:16:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-08 04:16:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-08 04:16:53,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-04-08 04:16:55,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:55,730 INFO L225 Difference]: With dead ends: 49 [2022-04-08 04:16:55,730 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:16:55,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:16:55,731 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:55,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 22.2s Time] [2022-04-08 04:16:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:16:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:16:55,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:55,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:55,783 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:55,783 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:55,785 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 04:16:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 04:16:55,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:55,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:55,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 04:16:55,787 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 04:16:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:55,789 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 04:16:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 04:16:55,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:55,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:55,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:55,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-08 04:16:55,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-04-08 04:16:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:55,792 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-08 04:16:55,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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 04:16:55,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 40 transitions. [2022-04-08 04:16:55,848 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 04:16:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 04:16:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:16:55,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:55,849 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:55,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:16:55,849 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash -133245550, now seen corresponding path program 1 times [2022-04-08 04:16:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:55,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112139693] [2022-04-08 04:20:29,612 WARN L232 SmtUtils]: Spent 3.28m on a formula simplification. DAG size of input: 162 DAG size of output: 158 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:20:33,986 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:20:38,275 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:20:40,466 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-08 04:20:44,871 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:24:05,884 WARN L232 SmtUtils]: Spent 3.06m on a formula simplification. DAG size of input: 162 DAG size of output: 158 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:24:05,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:24:05,947 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:24:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash 278517724, now seen corresponding path program 1 times [2022-04-08 04:24:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:24:05,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615956748] [2022-04-08 04:24:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:24:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:24:06,002 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,002 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,002 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4294967296) 0) [2022-04-08 04:24:06,002 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0)) (- 9)) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 9)) 477218588) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 8)) 9)) 477218588) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 9)) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 9)) 0) [2022-04-08 04:24:06,003 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 9)) 477218588) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0)) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~v6~0_5 (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_5) (* (- 1) main_~v6~0_7) 1) 0)) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 8) 0) [2022-04-08 04:24:06,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,005 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,005 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,007 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v5~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~v6~0_5) (* 4294967295 main_~i~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_161_321.3) (* (- 1) .aux_mod_aux_mod_v_it_1_161_321.2)) 0)) [2022-04-08 04:24:06,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_161.4) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.3) .aux_mod_aux_mod_v_it_1_161_321.2 (* (- 4294967296) main_~v3~0_5) (* (- 1) main_~l~0_5) (* (- 4294967296) main_~i~0_5) (* (- 1) main_~v6~0_7) (* (- 4294967296) main_~k~0_5) (* (- 4294967296) main_~v4~0_5) (* (- 4294967296) main_~v5~0_5) (* (- 4294967296) main_~v2~0_5) (* (- 4294967295) main_~v6~0_5) (* (- 4294967296) main_~v1~0_5) (* (- 4294967296) main_~j~0_5)) 0)) [2022-04-08 04:24:06,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v5~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~v6~0_5) (* 4294967295 main_~i~0_5)) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.3)) [2022-04-08 04:24:06,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 main_~v3~0_5) main_~l~0_5 (* 4294967296 main_~i~0_5) (* 4294967296 main_~v6~0_5) (* 4294967296 main_~k~0_5) (* 4294967296 main_~v4~0_5) (* 4294967296 main_~v5~0_5) (* 4294967296 main_~v2~0_5) (* 4294967296 main_~v1~0_5) (* 4294967296 main_~j~0_5) (* (- 4294967296) .aux_div_v_it_1_161.4) (* (- 4294967296) .aux_div_aux_mod_v_it_1_161_321.3) (* (- 1) .aux_mod_aux_mod_v_it_1_161_321.2) 2) 0)) [2022-04-08 04:24:06,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~l~0_5) (* (- 4294967295) main_~v4~0_5) (* (- 4294967295) main_~v2~0_5) (* (- 4294967295) main_~v5~0_5) (* (- 4294967295) main_~v1~0_5) (* (- 4294967295) main_~j~0_5) (* (- 4294967295) main_~k~0_5) (* (- 4294967295) main_~v3~0_5) (* (- 4294967295) main_~v6~0_5) (* (- 4294967295) main_~i~0_5) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.3) .aux_mod_aux_mod_v_it_1_161_321.2 (- 4294967295)) 0)) [2022-04-08 04:24:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:24:06,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) 4294967296) 0) [2022-04-08 04:24:06,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5)) (- 9)) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967296)) 9)) 477218588) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (- 8)) 9)) 477218588) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5) 1) (- 9)) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) (- 9)) 0) [2022-04-08 04:24:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) 9)) 477218588) 0) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5)) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5) 1) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.5) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~v6~0_5 (* 4294967296 .aux_div_v_it_1_42.5) (* (- 1) main_~l~0_5) (* (- 1) main_~v6~0_7) 1) 0)) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5)) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) 8) 0) [2022-04-08 04:24:06,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) (- 9)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967296)) 9)) (- 1)) 0) [2022-04-08 04:24:06,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5) 1) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (- 4294967295)) 9)) (- 1)) 0) [2022-04-08 04:24:06,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~v6~0_7) main_~v6~0_5 (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.6) (* (- 1) main_~l~0_5) (* 4294967296 .aux_div_v_it_1_42.5) 1) (- 9)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.5) (- 8)) 9)) (- 1)) 0) [2022-04-08 04:24:06,082 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v5~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~v6~0_5) (* 4294967295 main_~i~0_5) (* (- 4294967296) .aux_div_aux_mod_v_it_1_161_321.8) (* (- 1) .aux_mod_aux_mod_v_it_1_161_321.7)) 0)) [2022-04-08 04:24:06,082 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_161.9) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.8) .aux_mod_aux_mod_v_it_1_161_321.7 (* (- 4294967296) main_~v3~0_5) (* (- 1) main_~l~0_5) (* (- 4294967296) main_~i~0_5) (* (- 1) main_~v6~0_7) (* (- 4294967296) main_~k~0_5) (* (- 4294967296) main_~v4~0_5) (* (- 4294967296) main_~v5~0_5) (* (- 4294967296) main_~v2~0_5) (* (- 4294967295) main_~v6~0_5) (* (- 4294967296) main_~v1~0_5) (* (- 4294967296) main_~j~0_5)) 0)) [2022-04-08 04:24:06,082 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (= (+ main_~l~0_5 (* 4294967295 main_~v4~0_5) (* 4294967295 main_~v2~0_5) (* 4294967295 main_~v5~0_5) (* 4294967295 main_~v1~0_5) (* 4294967295 main_~j~0_5) (* 4294967295 main_~k~0_5) (* 4294967295 main_~v3~0_5) (* 4294967295 main_~v6~0_5) (* 4294967295 main_~i~0_5)) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.8)) [2022-04-08 04:24:06,082 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 main_~v3~0_5) main_~l~0_5 (* 4294967296 main_~i~0_5) (* 4294967296 main_~v6~0_5) (* 4294967296 main_~k~0_5) (* 4294967296 main_~v4~0_5) (* 4294967296 main_~v5~0_5) (* 4294967296 main_~v2~0_5) (* 4294967296 main_~v1~0_5) (* 4294967296 main_~j~0_5) (* (- 4294967296) .aux_div_v_it_1_161.9) (* (- 4294967296) .aux_div_aux_mod_v_it_1_161_321.8) (* (- 1) .aux_mod_aux_mod_v_it_1_161_321.7) 2) 0)) [2022-04-08 04:24:06,082 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~l~0_5) (* (- 4294967295) main_~v4~0_5) (* (- 4294967295) main_~v2~0_5) (* (- 4294967295) main_~v5~0_5) (* (- 4294967295) main_~v1~0_5) (* (- 4294967295) main_~j~0_5) (* (- 4294967295) main_~k~0_5) (* (- 4294967295) main_~v3~0_5) (* (- 4294967295) main_~v6~0_5) (* (- 4294967295) main_~i~0_5) (* 4294967296 .aux_div_aux_mod_v_it_1_161_321.8) .aux_mod_aux_mod_v_it_1_161_321.7 (- 4294967295)) 0)) [2022-04-08 04:24:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:24:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:24:06,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {576#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {565#true} is VALID [2022-04-08 04:24:06,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 04:24:06,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-08 04:24:06,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {576#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:24:06,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {565#true} is VALID [2022-04-08 04:24:06,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 04:24:06,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-08 04:24:06,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret5 := main(); {565#true} is VALID [2022-04-08 04:24:06,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {570#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {570#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} [95] L42-1-->L23_primed: Formula: (let ((.cse0 (mod v_main_~n~0_7 4294967296)) (.cse42 (mod v_main_~l~0_27 4294967296))) (let ((.cse1 (= (mod (mod .cse42 9) 4294967296) 0)) (.cse2 (< .cse42 .cse0)) (.cse3 (= (mod (+ v_main_~v1~0_8 v_main_~v2~0_8 v_main_~v3~0_8 v_main_~v4~0_8 v_main_~v5~0_8 v_main_~v6~0_9 v_main_~i~0_8 v_main_~j~0_8 v_main_~k~0_8 1) 4294967296) (mod (+ v_main_~l~0_27 1) 4294967296))) (.cse40 (= v_main_~v6~0_9 v_main_~v6~0_8)) (.cse41 (= v_main_~l~0_27 v_main_~l~0_26))) (or (and (< v_main_~v6~0_9 v_main_~v6~0_8) (= (+ v_main_~l~0_26 v_main_~v6~0_9) (+ v_main_~l~0_27 v_main_~v6~0_8)) (<= (div (+ (* (- 1) v_main_~v6~0_8) v_main_~v6~0_9 .cse0 (* v_main_~l~0_27 (- 1))) (- 4294967296)) (+ (div (+ v_main_~l~0_27 (- 4294967295)) 4294967296) 1)) .cse1 .cse2 .cse3 (forall ((aux_mod_aux_mod_v_it_1_161_321 Int) (aux_div_aux_mod_v_it_1_161_321 Int) (aux_div_v_it_1_161 Int)) (let ((.cse16 (* aux_div_aux_mod_v_it_1_161_321 4294967296)) (.cse17 (* v_main_~v4~0_8 4294967295)) (.cse18 (* v_main_~v2~0_8 4294967295)) (.cse19 (* v_main_~v5~0_8 4294967295)) (.cse20 (* v_main_~v1~0_8 4294967295)) (.cse21 (* v_main_~j~0_8 4294967295)) (.cse22 (* v_main_~k~0_8 4294967295)) (.cse23 (* v_main_~v3~0_8 4294967295)) (.cse13 (* v_main_~v6~0_9 4294967295)) (.cse24 (* v_main_~i~0_8 4294967295))) (let ((.cse5 (+ v_main_~l~0_27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse24)) (.cse7 (* v_main_~v3~0_8 4294967296)) (.cse8 (* v_main_~i~0_8 4294967296)) (.cse9 (* v_main_~k~0_8 4294967296)) (.cse10 (* v_main_~v4~0_8 4294967296)) (.cse11 (* v_main_~v5~0_8 4294967296)) (.cse12 (* v_main_~v2~0_8 4294967296)) (.cse14 (* v_main_~v1~0_8 4294967296)) (.cse15 (* v_main_~j~0_8 4294967296)) (.cse6 (+ (* aux_div_v_it_1_161 4294967296) .cse16 aux_mod_aux_mod_v_it_1_161_321)) (.cse4 (+ .cse16 aux_mod_aux_mod_v_it_1_161_321))) (or (< aux_mod_aux_mod_v_it_1_161_321 0) (<= 4294967296 aux_mod_aux_mod_v_it_1_161_321) (< .cse4 .cse5) (not (<= .cse6 (+ .cse7 v_main_~l~0_27 .cse8 v_main_~v6~0_8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (= .cse5 .cse16) (not (<= (+ .cse7 v_main_~l~0_27 .cse8 2 (* v_main_~v6~0_9 4294967296) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) .cse6)) (<= (+ v_main_~l~0_27 .cse17 .cse18 .cse19 .cse20 4294967296 .cse21 .cse22 .cse23 .cse13 .cse24) .cse4))))) (or (< v_main_~v6~0_8 (+ v_main_~v6~0_9 2)) (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse38 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296))) (.cse39 (* aux_div_v_it_1_42 (- 4294967296)))) (let ((.cse31 (div (+ v_main_~l~0_27 .cse39 (- 8)) 9)) (.cse33 (div (+ v_main_~l~0_27 .cse39 .cse38 (- 4294967295)) 9)) (.cse30 (div (+ .cse38 (- 4294967296)) 9)) (.cse28 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse36 (* (- 1) v_main_~v6~0_8)) (.cse37 (* v_main_~l~0_27 (- 1))) (.cse35 (* aux_div_v_it_1_42 4294967296))) (let ((.cse27 (div (+ .cse36 v_main_~v6~0_9 .cse37 .cse35) (- 9))) (.cse25 (div (+ .cse28 (- 4294967295)) (- 9))) (.cse34 (+ .cse30 1)) (.cse26 (+ .cse33 1)) (.cse32 (div (+ .cse36 v_main_~v6~0_9 .cse28 .cse37 .cse35 1) (- 9))) (.cse29 (+ 1 .cse31))) (or (<= .cse25 .cse26) (<= .cse27 .cse26) (<= (+ .cse28 4294967296) 0) (<= .cse27 0) (<= .cse25 .cse29) (<= 477218588 .cse30) (<= 477218588 .cse31) (<= .cse32 0) (<= .cse25 0) (<= 477218588 .cse33) (<= .cse27 .cse34) (<= .cse32 .cse34) (<= (+ 4294967295 .cse35) v_main_~l~0_27) (< (+ v_main_~l~0_27 v_main_~v6~0_8) (+ v_main_~v6~0_9 .cse35 1)) (<= .cse27 .cse29) (<= 8 .cse28) (<= .cse25 .cse34) (<= .cse32 .cse26) (<= .cse32 .cse29)))))))) (and (= v_main_~v1~0_8 v_main_~v1~0_8) (= v_main_~v4~0_8 v_main_~v4~0_8) (= v_main_~i~0_8 v_main_~i~0_8) (= v_main_~j~0_8 v_main_~j~0_8) (= v_main_~v5~0_8 v_main_~v5~0_8) .cse40 (= v_main_~v3~0_8 v_main_~v3~0_8) (= v_main_~n~0_7 v_main_~n~0_7) (= v_main_~v2~0_8 v_main_~v2~0_8) .cse41 (= v_main_~k~0_8 v_main_~k~0_8)) (and (or (not .cse1) (not .cse2) (not .cse3)) .cse40 .cse41)))) InVars {main_~l~0=v_main_~l~0_27, main_~v1~0=v_main_~v1~0_8, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~v5~0=v_main_~v5~0_8, main_~v6~0=v_main_~v6~0_9, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_26, main_~v1~0=v_main_~v1~0_8, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~v5~0=v_main_~v5~0_8, main_~v6~0=v_main_~v6~0_8, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v6~0] {571#(and (= main_~v5~0 0) (<= main_~l~0 main_~v6~0) (<= main_~v6~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#(and (= main_~v5~0 0) (<= main_~l~0 main_~v6~0) (<= main_~v6~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} [94] L23_primed-->L23: Formula: (< (mod v_main_~l~0_6 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {571#(and (= main_~v5~0 0) (<= main_~l~0 main_~v6~0) (<= main_~v6~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#(and (= main_~v5~0 0) (<= main_~l~0 main_~v6~0) (<= main_~v6~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {572#(and (= main_~v5~0 0) (<= (+ main_~l~0 1) main_~v6~0) (= main_~k~0 0) (<= main_~v6~0 (+ main_~l~0 1)) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {572#(and (= main_~v5~0 0) (<= (+ main_~l~0 1) main_~v6~0) (= main_~k~0 0) (<= main_~v6~0 (+ main_~l~0 1)) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {573#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 04:24:06,416 INFO L272 TraceCheckUtils]: 11: Hoare triple {573#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {574#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:24:06,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:24:06,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {566#false} is VALID [2022-04-08 04:24:06,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-08 04:24:06,417 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 04:24:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:24:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615956748] [2022-04-08 04:24:06,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615956748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:24:06,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:24:06,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:24:21,093 WARN L232 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 93 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:24:21,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:24:21,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112139693] [2022-04-08 04:24:21,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112139693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:24:21,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:24:21,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:24:21,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640613149] [2022-04-08 04:24:21,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:24:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 04:24:21,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:24:21,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:24:21,413 WARN L143 InductivityCheck]: Transition 584#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)) ( _ , assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); , 571#(and (= main_~v5~0 0) (<= main_~l~0 main_~v6~0) (<= main_~v6~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0)) ) not inductive [2022-04-08 04:24:21,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:24:21,414 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:24:21,417 INFO L158 Benchmark]: Toolchain (without parser) took 549345.94ms. Allocated memory was 175.1MB in the beginning and 259.0MB in the end (delta: 83.9MB). Free memory was 121.5MB in the beginning and 141.5MB in the end (delta: -20.0MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. [2022-04-08 04:24:21,417 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:24:21,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.14ms. Allocated memory was 175.1MB in the beginning and 259.0MB in the end (delta: 83.9MB). Free memory was 121.3MB in the beginning and 232.9MB in the end (delta: -111.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:24:21,418 INFO L158 Benchmark]: Boogie Preprocessor took 42.16ms. Allocated memory is still 259.0MB. Free memory was 232.9MB in the beginning and 231.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:24:21,418 INFO L158 Benchmark]: RCFGBuilder took 11192.48ms. Allocated memory is still 259.0MB. Free memory was 231.4MB in the beginning and 217.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 04:24:21,419 INFO L158 Benchmark]: TraceAbstraction took 537780.82ms. Allocated memory is still 259.0MB. Free memory was 217.2MB in the beginning and 141.5MB in the end (delta: 75.7MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-04-08 04:24:21,420 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.14ms. Allocated memory was 175.1MB in the beginning and 259.0MB in the end (delta: 83.9MB). Free memory was 121.3MB in the beginning and 232.9MB in the end (delta: -111.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.16ms. Allocated memory is still 259.0MB. Free memory was 232.9MB in the beginning and 231.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 11192.48ms. Allocated memory is still 259.0MB. Free memory was 231.4MB in the beginning and 217.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 537780.82ms. Allocated memory is still 259.0MB. Free memory was 217.2MB in the beginning and 141.5MB in the end (delta: 75.7MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:24:21,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...