/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-fb4f59a-m [2022-04-28 04:02:34,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:02:34,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:02:34,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:02:34,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:02:34,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:02:34,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:02:34,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:02:34,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:02:34,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:02:34,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:02:34,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:02:34,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:02:34,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:02:34,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:02:34,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:02:34,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:02:34,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:02:34,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:02:34,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:02:34,709 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:02:34,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:02:34,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:02:34,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:02:34,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:02:34,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:02:34,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:02:34,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:02:34,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:02:34,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:02:34,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:02:34,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:02:34,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:02:34,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:02:34,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:02:34,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:02:34,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:02:34,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:02:34,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:02:34,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:02:34,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:02:34,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:02:34,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:02:34,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:02:34,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:02:34,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:02:34,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:02:34,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:02:34,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:02:34,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:02:34,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:02:34,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:02:34,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:02:34,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:02:34,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:02:34,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:02:34,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:02:34,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:02:34,744 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:02:34,745 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-28 04:02:34,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:02:34,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:02:34,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:02:34,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:02:34,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:02:34,927 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-28 04:02:34,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed6004d/585e898d3fd04780b2b7f4633660fe7d/FLAGe958b85db [2022-04-28 04:02:35,330 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:02:35,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-28 04:02:35,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed6004d/585e898d3fd04780b2b7f4633660fe7d/FLAGe958b85db [2022-04-28 04:02:35,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fed6004d/585e898d3fd04780b2b7f4633660fe7d [2022-04-28 04:02:35,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:02:35,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:02:35,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:02:35,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:02:35,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:02:35,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b171a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35, skipping insertion in model container [2022-04-28 04:02:35,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:02:35,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:02:35,460 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-28 04:02:35,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:02:35,494 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:02:35,502 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-28 04:02:35,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:02:35,517 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:02:35,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35 WrapperNode [2022-04-28 04:02:35,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:02:35,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:02:35,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:02:35,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:02:35,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:02:35,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:02:35,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:02:35,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:02:35,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (1/1) ... [2022-04-28 04:02:35,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:02:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:02:35,588 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-28 04:02:35,593 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-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:02:35,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:02:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:02:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:02:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:02:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:02:35,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:02:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:02:35,668 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:02:35,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:02:46,720 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:02:46,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:02:46,725 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:02:46,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:02:46 BoogieIcfgContainer [2022-04-28 04:02:46,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:02:46,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:02:46,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:02:46,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:02:46,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:02:35" (1/3) ... [2022-04-28 04:02:46,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:02:46, skipping insertion in model container [2022-04-28 04:02:46,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:02:35" (2/3) ... [2022-04-28 04:02:46,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:02:46, skipping insertion in model container [2022-04-28 04:02:46,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:02:46" (3/3) ... [2022-04-28 04:02:46,731 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2022-04-28 04:02:46,741 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:02:46,741 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:02:46,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:02:46,774 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c140ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66d81776 [2022-04-28 04:02:46,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:02:46,780 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-28 04:02:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:02:46,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:46,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:46,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 1 times [2022-04-28 04:02:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:46,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1641542175] [2022-04-28 04:02:46,801 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:02:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 2 times [2022-04-28 04:02:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:46,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540912801] [2022-04-28 04:02:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:47,457 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-28 04:02:47,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:02:47,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-28 04:02:47,458 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-28 04:02:47,459 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-28 04:02:47,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:02:47,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-28 04:02:47,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 04:02:47,460 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-28 04:02:47,461 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-28 04:02:47,461 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-28 04:02:47,462 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-28 04:02:47,464 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-28 04:02:47,466 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-28 04:02:47,466 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-28 04:02:47,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-28 04:02:47,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 04:02:47,467 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-28 04:02:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:47,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540912801] [2022-04-28 04:02:47,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540912801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:47,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:47,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:02:47,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1641542175] [2022-04-28 04:02:47,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1641542175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:47,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:47,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:02:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182321411] [2022-04-28 04:02:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:47,475 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-28 04:02:47,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:47,477 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-28 04:02:47,493 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-28 04:02:47,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:02:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:47,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:02:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:02:47,508 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-28 04:02:49,766 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-28 04:02:54,273 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-28 04:02:58,589 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-28 04:03:00,744 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-28 04:03:05,105 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-28 04:03:07,267 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-28 04:03:09,430 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-28 04:03:13,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:18,082 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-28 04:03:20,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:22,439 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-28 04:03:29,143 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-28 04:03:31,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:33,437 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-28 04:03:35,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:38,042 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-28 04:03:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:03:38,042 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-28 04:03:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:38,043 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-28 04:03:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 04:03:38,050 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-28 04:03:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 04:03:38,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 04:03:38,164 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-28 04:03:38,170 INFO L225 Difference]: With dead ends: 67 [2022-04-28 04:03:38,170 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 04:03:38,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:03:38,174 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:38,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 14 Unknown, 0 Unchecked, 31.6s Time] [2022-04-28 04:03:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 04:03:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 04:03:38,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:38,211 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-28 04:03:38,211 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-28 04:03:38,212 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-28 04:03:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:38,217 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 04:03:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-28 04:03:38,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:38,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:38,218 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-28 04:03:38,218 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-28 04:03:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:38,221 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 04:03:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-28 04:03:38,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:38,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:38,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:38,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:38,222 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-28 04:03:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 04:03:38,224 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 04:03:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:38,225 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 04:03:38,225 INFO L496 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-28 04:03:38,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 04:03:38,271 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-28 04:03:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 04:03:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:03:38,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:38,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:03:38,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 1 times [2022-04-28 04:03:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850726207] [2022-04-28 04:03:38,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:03:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 2 times [2022-04-28 04:03:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:38,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269061463] [2022-04-28 04:03:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:38,567 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-28 04:03:38,568 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-28 04:03:38,570 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-28 04:03:38,572 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-28 04:03:38,572 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-28 04:03:38,573 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-28 04:03:38,574 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-28 04:03:38,575 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-28 04:03:38,576 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-28 04:03:38,576 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-28 04:03:38,577 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-28 04:03:38,577 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-28 04:03:38,578 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-28 04:03:38,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#false} ~l~0 := 1 + ~l~0; {324#false} is VALID [2022-04-28 04:03:38,578 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-28 04:03:38,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 04:03:38,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 04:03:38,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 04:03:38,579 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-28 04:03:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269061463] [2022-04-28 04:03:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269061463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:03:38,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:38,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850726207] [2022-04-28 04:03:38,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850726207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:38,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:38,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:03:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770467459] [2022-04-28 04:03:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:38,585 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-28 04:03:38,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:38,585 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-28 04:03:40,756 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-28 04:03:40,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:03:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:03:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:03:40,760 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-28 04:03:45,152 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-28 04:03:47,309 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-28 04:03:49,503 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-28 04:03:51,606 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-28 04:03:55,930 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-28 04:03:58,095 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-28 04:04:04,571 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-28 04:04:06,692 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-28 04:04:11,085 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-28 04:04:13,195 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-28 04:04:17,582 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-28 04:04:19,740 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-28 04:04:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:19,924 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-28 04:04:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:04:19,924 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-28 04:04:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:04:19,925 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-28 04:04:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-28 04:04:19,926 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-28 04:04:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-28 04:04:19,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-04-28 04:04:22,191 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-28 04:04:22,193 INFO L225 Difference]: With dead ends: 49 [2022-04-28 04:04:22,193 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:04:22,193 INFO L412 NwaCegarLoop]: 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-28 04:04:22,194 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:04:22,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 24.1s Time] [2022-04-28 04:04:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:04:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 04:04:22,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:04:22,250 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-28 04:04:22,251 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-28 04:04:22,251 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-28 04:04:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:22,252 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 04:04:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 04:04:22,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:22,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:22,253 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-28 04:04:22,253 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-28 04:04:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:04:22,255 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 04:04:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 04:04:22,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:04:22,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:04:22,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:04:22,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:04:22,255 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-28 04:04:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-28 04:04:22,257 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-04-28 04:04:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:04:22,257 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-28 04:04:22,257 INFO L496 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-28 04:04:22,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 40 transitions. [2022-04-28 04:04:22,301 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-28 04:04:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 04:04:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:04:22,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:04:22,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:04:22,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:04:22,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:04:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:04:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -133245550, now seen corresponding path program 1 times [2022-04-28 04:04:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:04:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874043612] [2022-04-28 04:05:54,492 WARN L232 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 144 DAG size of output: 45 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:05:58,763 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:03,079 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:05,276 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-28 04:06:09,545 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:07:52,000 WARN L232 SmtUtils]: Spent 1.42m on a formula simplification. DAG size of input: 144 DAG size of output: 45 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:07:52,011 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:52,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 278517724, now seen corresponding path program 1 times [2022-04-28 04:07:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:52,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716251248] [2022-04-28 04:07:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:52,424 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-28 04:07:52,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:07:52,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-28 04:07:52,425 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-28 04:07:52,425 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-28 04:07:52,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:07:52,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-28 04:07:52,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret5 := main(); {565#true} is VALID [2022-04-28 04:07:52,426 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-28 04:07:52,426 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-28 04:07:52,428 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 ((.cse5 (mod v_main_~l~0_27 4294967296))) (let ((.cse0 (= v_main_~v6~0_9 v_main_~v6~0_8)) (.cse1 (= v_main_~l~0_27 v_main_~l~0_26)) (.cse2 (= (mod (mod .cse5 9) 4294967296) 0)) (.cse3 (< .cse5 (mod v_main_~n~0_7 4294967296))) (.cse4 (= (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)))) (or (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) .cse0 (= 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) .cse1 (= v_main_~k~0_8 v_main_~k~0_8)) (and (or (not .cse2) (not .cse3) (not .cse4)) .cse0 .cse1) (and (< v_main_~v6~0_9 v_main_~v6~0_8) (< v_main_~v6~0_8 (+ v_main_~v6~0_9 2)) (= (+ v_main_~l~0_26 v_main_~v6~0_9) (+ v_main_~l~0_27 v_main_~v6~0_8)) .cse2 .cse3 .cse4)))) 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-28 04:07:52,428 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-28 04:07:52,430 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-28 04:07:52,431 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-28 04:07:52,433 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-28 04:07:52,433 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-28 04:07:52,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {566#false} is VALID [2022-04-28 04:07:52,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-28 04:07:52,434 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-28 04:07:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:52,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716251248] [2022-04-28 04:07:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716251248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:52,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:07:54,873 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= (mod (mod .cse0 9) 4294967296) 0) (let ((.cse1 (+ c_main_~v6~0 (- 1)))) (or (and (= c_main_~l~0 .cse1) (< 1 c_main_~v6~0) (< c_main_~v6~0 3)) (and (= c_main_~l~0 0) (= .cse1 0)))) (= c_main_~i~0 0) (= c_main_~v1~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~v5~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from true [2022-04-28 04:07:57,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (let ((.cse0 (+ (- 1) c_main_~l~0)) (.cse1 (+ c_main_~v6~0 (- 1)))) (or (and (< 1 c_main_~v6~0) (< c_main_~v6~0 3) (= .cse0 .cse1)) (and (= .cse0 0) (= .cse1 0)))) (= (mod (mod .cse2 9) 4294967296) 0) (= c_main_~i~0 0) (= c_main_~v1~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (= c_main_~v5~0 0) (< .cse2 (mod c_main_~n~0 4294967296)) (= c_main_~v3~0 0) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from false [2022-04-28 04:08:59,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:59,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874043612] [2022-04-28 04:08:59,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874043612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:59,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:59,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:08:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950752225] [2022-04-28 04:08:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:59,308 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-28 04:08:59,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:59,309 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-28 04:09:04,064 WARN L143 InductivityCheck]: Transition 584#(exists ((v_main_~v6~0_15 Int) (aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 Int) (aux_div_aux_mod_v_main_~l~0_33_46_42 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 Int) (aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (< aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 4294967296) (< (+ (* aux_div_aux_mod_v_main_~l~0_33_46_42 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) aux_mod_v_main_~n~0_BEFORE_RETURN_1_44) (<= 0 (+ (* aux_div_aux_mod_v_main_~l~0_33_46_42 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44))) (or (and (not (= (mod (+ 1 (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) 4294967296) (mod v_main_~v6~0_15 4294967296))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (mod (+ 1 (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) 4294967296) (mod v_main_~v6~0_15 4294967296)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) 9) (or (and (= v_main_~v6~0_15 1) (exists ((aux_div_v_main_~l~0_33_46 Int)) (= (+ (* aux_div_aux_mod_v_main_~l~0_33_46_42 4294967296) (* aux_div_v_main_~l~0_33_46 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) 4294967296))) (and (< v_main_~v6~0_15 3) (exists ((aux_div_v_main_~l~0_33_46 Int)) (= (+ v_main_~v6~0_15 4294967295) (+ (* aux_div_aux_mod_v_main_~l~0_33_46_42 4294967296) (* aux_div_v_main_~l~0_33_46 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)))) (< 1 v_main_~v6~0_15))) (<= 0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44))) (or (and (= (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)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (and (not (= (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))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) 4294967296) (<= 0 aux_mod_v_main_~n~0_BEFORE_RETURN_1_44) (< (+ (* aux_div_aux_mod_v_main_~l~0_33_46_42 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~l~0_33_46_42_44_64 4294967296) (* 9 aux_div_aux_mod_aux_mod_v_main_~l~0_33_46_42_44)) 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-28 04:09:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:09:04,065 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 04:09:04,068 INFO L158 Benchmark]: Toolchain (without parser) took 388722.79ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 136.8MB in the beginning and 111.5MB in the end (delta: 25.3MB). Peak memory consumption was 64.5MB. Max. memory is 8.0GB. [2022-04-28 04:09:04,068 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 153.1MB in the beginning and 153.0MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:09:04,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.51ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 161.2MB in the end (delta: -24.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 04:09:04,069 INFO L158 Benchmark]: Boogie Preprocessor took 44.41ms. Allocated memory is still 185.6MB. Free memory was 161.2MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:09:04,069 INFO L158 Benchmark]: RCFGBuilder took 11163.77ms. Allocated memory is still 185.6MB. Free memory was 159.6MB in the beginning and 146.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:09:04,069 INFO L158 Benchmark]: TraceAbstraction took 377339.65ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 146.0MB in the beginning and 111.5MB in the end (delta: 34.5MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2022-04-28 04:09:04,070 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.11ms. Allocated memory is still 185.6MB. Free memory was 153.1MB in the beginning and 153.0MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.51ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 161.2MB in the end (delta: -24.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.41ms. Allocated memory is still 185.6MB. Free memory was 161.2MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 11163.77ms. Allocated memory is still 185.6MB. Free memory was 159.6MB in the beginning and 146.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 377339.65ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 146.0MB in the beginning and 111.5MB in the end (delta: 34.5MB). Peak memory consumption was 73.3MB. 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-28 04:09:04,105 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...