/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:28:29,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:28:29,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:28:29,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:28:29,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:28:29,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:28:29,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:28:29,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:28:29,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:28:29,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:28:29,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:28:29,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:28:29,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:28:29,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:28:29,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:28:29,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:28:29,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:28:29,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:28:29,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:28:29,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:28:29,730 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:28:29,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:28:29,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:28:29,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:28:29,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:28:29,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:28:29,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:28:29,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:28:29,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:28:29,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:28:29,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:28:29,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:28:29,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:28:29,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:28:29,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:28:29,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:28:29,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:28:29,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:28:29,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:28:29,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:28:29,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:28:29,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:28:29,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:28:29,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:28:29,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:28:29,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:28:29,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:28:29,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:28:29,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:28:29,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:28:29,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:29,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:28:29,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:28:29,760 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:28:29,760 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:28:29,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:28:29,760 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:28:29,760 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 10:28:29,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:28:29,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:28:29,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:28:29,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:28:29,943 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:28:29,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-28 10:28:29,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be1289/39d0afd7b97b4eb2941c2266c89dd7dc/FLAG5b2162d8c [2022-04-28 10:28:30,368 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:28:30,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-28 10:28:30,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be1289/39d0afd7b97b4eb2941c2266c89dd7dc/FLAG5b2162d8c [2022-04-28 10:28:30,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be1289/39d0afd7b97b4eb2941c2266c89dd7dc [2022-04-28 10:28:30,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:28:30,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:28:30,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:30,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:28:30,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:28:30,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a15c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30, skipping insertion in model container [2022-04-28 10:28:30,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:28:30,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:28:30,568 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/sumt5.c[403,416] [2022-04-28 10:28:30,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:30,591 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:28:30,615 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/sumt5.c[403,416] [2022-04-28 10:28:30,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:30,630 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:28:30,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30 WrapperNode [2022-04-28 10:28:30,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:30,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:28:30,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:28:30,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:28:30,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:28:30,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:28:30,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:28:30,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:28:30,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (1/1) ... [2022-04-28 10:28:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:30,691 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 10:28:30,699 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 10:28:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:28:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:28:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:28:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:28:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:28:30,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:28:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:28:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:28:30,758 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:28:30,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:28:35,301 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:28:35,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:28:35,317 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:28:35,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:28:35 BoogieIcfgContainer [2022-04-28 10:28:35,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:28:35,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:28:35,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:28:35,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:28:35,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:28:30" (1/3) ... [2022-04-28 10:28:35,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:28:35, skipping insertion in model container [2022-04-28 10:28:35,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:30" (2/3) ... [2022-04-28 10:28:35,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575d315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:28:35, skipping insertion in model container [2022-04-28 10:28:35,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:28:35" (3/3) ... [2022-04-28 10:28:35,324 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-28 10:28:35,333 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:28:35,333 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:28:35,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:28:35,365 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@6a85fc59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@918db63 [2022-04-28 10:28:35,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:28:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 10:28:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:28:35,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:35,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:35,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-28 10:28:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:35,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476826542] [2022-04-28 10:28:35,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:28:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 2 times [2022-04-28 10:28:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024159149] [2022-04-28 10:28:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:28:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:35,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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; {28#true} is VALID [2022-04-28 10:28:35,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:28:35,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-28 10:28:35,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:28:35,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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; {28#true} is VALID [2022-04-28 10:28:35,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:28:35,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-28 10:28:35,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-28 10:28:35,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:35,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:35,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:35,800 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:28:35,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:28:35,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-28 10:28:35,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 10:28:35,802 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 10:28:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:35,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024159149] [2022-04-28 10:28:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024159149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:35,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:28:35,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476826542] [2022-04-28 10:28:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476826542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:35,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:28:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391687433] [2022-04-28 10:28:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 10:28:35,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:35,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 10:28:35,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:35,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:28:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:35,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:28:35,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:28:35,840 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 10:28:37,983 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 10:28:42,373 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 10:28:44,537 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 10:28:46,699 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 10:28:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:47,002 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-28 10:28:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:28:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 10:28:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:28:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 10:28:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-28 10:28:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 10:28:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-28 10:28:47,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-28 10:28:47,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:47,103 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:28:47,103 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:28:47,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:28:47,111 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:28:47,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2022-04-28 10:28:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:28:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 10:28:47,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:28:47,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:47,139 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:47,139 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:47,144 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-28 10:28:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 10:28:47,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:47,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:47,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:28:47,146 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:28:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:28:47,149 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-28 10:28:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 10:28:47,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:28:47,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:28:47,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:28:47,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:28:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:28:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-28 10:28:47,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-28 10:28:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:28:47,160 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-28 10:28:47,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 10:28:47,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-28 10:28:47,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:28:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 10:28:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:28:47,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:47,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:47,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:28:47,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-28 10:28:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336646321] [2022-04-28 10:28:47,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:28:47,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:28:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 2 times [2022-04-28 10:28:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:47,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937532713] [2022-04-28 10:28:47,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:28:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:47,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#(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; {219#true} is VALID [2022-04-28 10:28:47,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 10:28:47,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 10:28:47,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {231#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:28:47,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#(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; {219#true} is VALID [2022-04-28 10:28:47,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 10:28:47,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 10:28:47,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-28 10:28:47,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:47,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:47,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:47,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {226#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:28:47,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {227#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-28 10:28:47,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {228#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} is VALID [2022-04-28 10:28:47,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {228#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:28:47,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {230#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:28:47,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {230#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {220#false} is VALID [2022-04-28 10:28:47,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-28 10:28:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937532713] [2022-04-28 10:28:47,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937532713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:28:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979054850] [2022-04-28 10:28:47,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:28:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:28:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:47,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:28:47,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:28:47,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:28:47,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:28:47,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:28:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:47,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:28:48,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2022-04-28 10:28:48,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-28 10:28:48,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 10:28:48,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 10:28:48,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-28 10:28:48,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:48,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:48,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:28:48,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {259#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:28:48,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:28:48,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:28:48,069 INFO L272 TraceCheckUtils]: 11: Hoare triple {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:28:48,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:28:48,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {220#false} is VALID [2022-04-28 10:28:48,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-28 10:28:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:28:48,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:28:48,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-28 10:28:48,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {220#false} is VALID [2022-04-28 10:28:48,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:28:48,272 INFO L272 TraceCheckUtils]: 11: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:28:48,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:28:48,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:28:50,398 WARN L290 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {297#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:28:50,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:28:50,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:28:50,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:28:50,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-28 10:28:50,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 10:28:50,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 10:28:50,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-28 10:28:50,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2022-04-28 10:28:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:28:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979054850] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:28:50,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:28:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-28 10:28:50,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:50,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336646321] [2022-04-28 10:28:50,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336646321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:50,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:50,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:28:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696472234] [2022-04-28 10:28:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 10:28:50,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:50,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states 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 10:28:52,528 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 10:28:52,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:28:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:52,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:28:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:28:52,529 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states 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 10:28:56,694 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 10:29:01,074 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 10:29:05,400 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 10:29:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:07,798 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 10:29:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:29:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 10:29:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states 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 10:29:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 10:29:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states 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 10:29:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 10:29:07,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-28 10:29:09,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:09,948 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:29:09,948 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:29:09,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:29:09,949 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 10:29:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:29:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 10:29:09,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:09,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,955 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,955 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:09,956 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 10:29:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:29:09,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:09,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:09,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:29:09,957 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:29:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:09,958 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 10:29:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:29:09,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:09,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:09,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:09,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-28 10:29:09,959 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2022-04-28 10:29:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:09,959 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-28 10:29:09,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states 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 10:29:09,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-28 10:29:12,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 10:29:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:29:12,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:12,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:29:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:12,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-28 10:29:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1510348327] [2022-04-28 10:29:12,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:12,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 2 times [2022-04-28 10:29:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858046921] [2022-04-28 10:29:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:12,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(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; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:12,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:12,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {469#true} #71#return; {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:12,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:12,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#(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; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:12,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:12,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {469#true} #71#return; {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:12,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:12,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {475#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:12,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {476#(= main_~l~0 0)} is VALID [2022-04-28 10:29:12,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {476#(= main_~l~0 0)} is VALID [2022-04-28 10:29:12,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {470#false} is VALID [2022-04-28 10:29:12,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {470#false} is VALID [2022-04-28 10:29:12,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#false} ~l~0 := 1 + ~l~0; {470#false} is VALID [2022-04-28 10:29:12,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {470#false} is VALID [2022-04-28 10:29:12,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {470#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {470#false} is VALID [2022-04-28 10:29:12,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#false} ~cond := #in~cond; {470#false} is VALID [2022-04-28 10:29:12,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#false} assume 0 == ~cond; {470#false} is VALID [2022-04-28 10:29:12,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-28 10:29:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858046921] [2022-04-28 10:29:12,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858046921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:12,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:12,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:12,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:12,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1510348327] [2022-04-28 10:29:12,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1510348327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:12,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:12,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015396709] [2022-04-28 10:29:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:29:12,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:12,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:14,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:29:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:29:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:29:14,745 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:16,876 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 10:29:23,346 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 10:29:27,758 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 10:29:29,936 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 10:29:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:30,190 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-28 10:29:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:29:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:29:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:29:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:29:30,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:29:32,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:32,402 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:29:32,402 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:29:32,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:29:32,403 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 60 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:32,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 10:29:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:29:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 10:29:32,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:32,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:32,428 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:32,428 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:32,429 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-28 10:29:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-28 10:29:32,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:32,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:32,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:29:32,430 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:29:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:32,431 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-28 10:29:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-28 10:29:32,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:32,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:32,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:32,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 10:29:32,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-28 10:29:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:32,433 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 10:29:32,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:32,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 10:29:34,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:29:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:29:34,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:34,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:34,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:29:34,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 1 times [2022-04-28 10:29:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905708774] [2022-04-28 10:29:34,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:34,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 2 times [2022-04-28 10:29:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:34,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444191559] [2022-04-28 10:29:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:34,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#(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; {649#true} is VALID [2022-04-28 10:29:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 10:29:34,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-28 10:29:34,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {656#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:34,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#(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; {649#true} is VALID [2022-04-28 10:29:34,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 10:29:34,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-28 10:29:34,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-28 10:29:34,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {654#(= main_~l~0 0)} is VALID [2022-04-28 10:29:34,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {654#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {654#(= main_~l~0 0)} is VALID [2022-04-28 10:29:34,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {654#(= main_~l~0 0)} is VALID [2022-04-28 10:29:34,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {654#(= main_~l~0 0)} is VALID [2022-04-28 10:29:34,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:29:34,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:29:34,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:29:34,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {650#false} is VALID [2022-04-28 10:29:34,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#false} ~l~0 := 1 + ~l~0; {650#false} is VALID [2022-04-28 10:29:34,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {650#false} is VALID [2022-04-28 10:29:34,726 INFO L272 TraceCheckUtils]: 15: Hoare triple {650#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {650#false} is VALID [2022-04-28 10:29:34,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-28 10:29:34,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-28 10:29:34,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-28 10:29:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444191559] [2022-04-28 10:29:34,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444191559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:29:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893437698] [2022-04-28 10:29:34,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:29:34,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:34,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:34,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:34,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:29:34,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:29:34,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:34,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:29:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:34,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:35,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-28 10:29:35,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-28 10:29:35,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 10:29:35,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-28 10:29:35,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-28 10:29:35,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:35,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:35,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:35,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {685#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {699#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-28 10:29:35,165 INFO L272 TraceCheckUtils]: 15: Hoare triple {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:35,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:35,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-28 10:29:35,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-28 10:29:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:35,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:35,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-28 10:29:35,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-28 10:29:35,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:35,381 INFO L272 TraceCheckUtils]: 15: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:35,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:35,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:35,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:35,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:35,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:35,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:37,517 WARN L290 TraceCheckUtils]: 8: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:29:37,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:37,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:37,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:37,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-28 10:29:37,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-28 10:29:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 10:29:37,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-28 10:29:37,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-28 10:29:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:29:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893437698] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:29:37,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-28 10:29:37,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905708774] [2022-04-28 10:29:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905708774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:37,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:37,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621272210] [2022-04-28 10:29:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:29:37,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:37,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states 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 10:29:39,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:39,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:29:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:29:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:29:39,671 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states 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 10:29:41,746 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 10:29:46,080 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 10:29:48,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:50,326 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 10:29:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:50,621 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-28 10:29:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:29:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:29:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states 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 10:29:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:29:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states 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 10:29:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:29:50,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-28 10:29:52,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:52,788 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:29:52,788 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:29:52,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:29:52,789 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:52,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 10:29:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:29:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-28 10:29:52,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:52,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:52,828 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:52,828 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:52,831 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 10:29:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 10:29:52,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:52,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:52,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:29:52,832 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:29:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:52,835 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 10:29:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 10:29:52,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:52,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:52,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:52,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-28 10:29:52,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-28 10:29:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:52,840 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-28 10:29:52,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states 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 10:29:52,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-28 10:29:55,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 10:29:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:29:55,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:55,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:55,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:29:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:29:55,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 923887238, now seen corresponding path program 1 times [2022-04-28 10:29:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466624509] [2022-04-28 10:29:55,305 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:55,305 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash 923887238, now seen corresponding path program 2 times [2022-04-28 10:29:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:55,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808808225] [2022-04-28 10:29:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:55,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:55,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {963#(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; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:55,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:55,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {951#true} #71#return; {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:55,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {963#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:55,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#(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; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:55,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:55,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {951#true} #71#return; {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:55,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:55,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {957#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:55,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {957#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {958#(= main_~l~0 0)} is VALID [2022-04-28 10:29:55,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {958#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {958#(= main_~l~0 0)} is VALID [2022-04-28 10:29:55,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {958#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {958#(= main_~l~0 0)} is VALID [2022-04-28 10:29:55,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {958#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {959#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:29:55,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {959#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:29:55,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:29:55,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:29:55,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {961#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:29:55,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {961#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {962#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-28 10:29:55,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {962#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {952#false} is VALID [2022-04-28 10:29:55,695 INFO L272 TraceCheckUtils]: 16: Hoare triple {952#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {952#false} is VALID [2022-04-28 10:29:55,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {952#false} ~cond := #in~cond; {952#false} is VALID [2022-04-28 10:29:55,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {952#false} assume 0 == ~cond; {952#false} is VALID [2022-04-28 10:29:55,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-28 10:29:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808808225] [2022-04-28 10:29:55,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808808225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:29:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341145968] [2022-04-28 10:29:55,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:29:55,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:55,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:29:55,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:29:55,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:29:55,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:55,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:29:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:55,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:56,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2022-04-28 10:29:56,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {951#true} is VALID [2022-04-28 10:29:56,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2022-04-28 10:29:56,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #71#return; {951#true} is VALID [2022-04-28 10:29:56,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret5 := main(); {951#true} is VALID [2022-04-28 10:29:56,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:56,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:56,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:56,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {993#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:29:56,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {993#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:29:56,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:29:56,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:29:56,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:29:56,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1010#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 10:29:56,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 10:29:56,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 10:29:56,226 INFO L272 TraceCheckUtils]: 16: Hoare triple {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:56,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:56,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {952#false} is VALID [2022-04-28 10:29:56,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-28 10:29:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:56,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:56,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-28 10:29:56,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {952#false} is VALID [2022-04-28 10:29:56,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:56,484 INFO L272 TraceCheckUtils]: 16: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:56,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:56,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:58,617 WARN L290 TraceCheckUtils]: 13: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:29:58,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:58,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:58,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:29:58,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:00,731 WARN L290 TraceCheckUtils]: 8: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:30:00,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:00,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:00,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:00,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret5 := main(); {951#true} is VALID [2022-04-28 10:30:00,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #71#return; {951#true} is VALID [2022-04-28 10:30:00,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2022-04-28 10:30:00,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {951#true} is VALID [2022-04-28 10:30:00,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2022-04-28 10:30:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:30:00,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341145968] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:00,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:00,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-28 10:30:00,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466624509] [2022-04-28 10:30:00,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466624509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:00,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:00,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214138613] [2022-04-28 10:30:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:00,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:30:00,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:00,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states 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 10:30:05,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:05,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:30:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:30:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:30:05,020 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states 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 10:30:07,097 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 10:30:09,333 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 10:30:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:09,610 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 10:30:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:30:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states 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 10:30:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:30:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states 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 10:30:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:30:09,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-28 10:30:11,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:11,768 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:30:11,768 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:30:11,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:30:11,769 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:11,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:30:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:30:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-28 10:30:11,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:11,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:11,799 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:11,799 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:11,801 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 10:30:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 10:30:11,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:11,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:11,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:30:11,802 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:30:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:11,803 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-28 10:30:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-28 10:30:11,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:11,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:11,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:11,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-28 10:30:11,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 20 [2022-04-28 10:30:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:11,807 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-28 10:30:11,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states 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 10:30:11,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-28 10:30:14,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 10:30:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:30:14,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:14,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:14,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:14,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:14,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -844641793, now seen corresponding path program 1 times [2022-04-28 10:30:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127942095] [2022-04-28 10:30:14,243 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:14,243 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -844641793, now seen corresponding path program 2 times [2022-04-28 10:30:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:14,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714292694] [2022-04-28 10:30:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:14,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#(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; {1271#true} is VALID [2022-04-28 10:30:14,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-28 10:30:14,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-28 10:30:14,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:14,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#(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; {1271#true} is VALID [2022-04-28 10:30:14,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-28 10:30:14,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-28 10:30:14,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-28 10:30:14,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1276#(= main_~l~0 0)} is VALID [2022-04-28 10:30:14,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1276#(= main_~l~0 0)} is VALID [2022-04-28 10:30:14,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1276#(= main_~l~0 0)} is VALID [2022-04-28 10:30:14,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1276#(= main_~l~0 0)} is VALID [2022-04-28 10:30:14,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:30:14,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:30:14,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:30:14,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:30:14,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:30:14,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1272#false} is VALID [2022-04-28 10:30:14,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {1272#false} ~l~0 := 1 + ~l~0; {1272#false} is VALID [2022-04-28 10:30:14,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1272#false} is VALID [2022-04-28 10:30:14,319 INFO L272 TraceCheckUtils]: 17: Hoare triple {1272#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1272#false} is VALID [2022-04-28 10:30:14,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2022-04-28 10:30:14,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#false} assume 0 == ~cond; {1272#false} is VALID [2022-04-28 10:30:14,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-28 10:30:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:14,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714292694] [2022-04-28 10:30:14,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714292694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:14,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696657952] [2022-04-28 10:30:14,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:14,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:14,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:14,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:30:14,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:14,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:14,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:30:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:14,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:14,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2022-04-28 10:30:14,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-28 10:30:14,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-28 10:30:14,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-28 10:30:14,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-28 10:30:14,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:14,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:14,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:14,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1327#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {1327#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:14,777 INFO L272 TraceCheckUtils]: 17: Hoare triple {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:14,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:14,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1272#false} is VALID [2022-04-28 10:30:14,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-28 10:30:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:14,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:14,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-28 10:30:14,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1272#false} is VALID [2022-04-28 10:30:14,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:14,972 INFO L272 TraceCheckUtils]: 17: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:14,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:14,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:17,095 WARN L290 TraceCheckUtils]: 8: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:30:17,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:17,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:17,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:17,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-28 10:30:17,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-28 10:30:17,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-28 10:30:17,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-28 10:30:17,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2022-04-28 10:30:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:30:17,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696657952] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:17,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:17,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-28 10:30:17,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:17,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127942095] [2022-04-28 10:30:17,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127942095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:17,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:17,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235223021] [2022-04-28 10:30:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:30:17,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:17,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states 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 10:30:19,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:19,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:30:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:30:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:30:19,252 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states 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 10:30:21,308 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 10:30:23,587 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 10:30:25,717 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 10:30:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:26,049 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 10:30:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:30:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states 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 10:30:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-28 10:30:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states 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 10:30:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-28 10:30:26,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-28 10:30:28,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:28,266 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:30:28,266 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:30:28,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:30:28,266 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:28,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 10:30:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:30:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:30:28,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:28,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:28,300 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:28,300 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:28,301 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-28 10:30:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-28 10:30:28,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:28,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:28,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:30:28,302 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:30:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:28,303 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-28 10:30:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-28 10:30:28,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:28,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:28,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:28,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 10:30:28,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 21 [2022-04-28 10:30:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:28,304 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-28 10:30:28,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states 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 10:30:28,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 10:30:39,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 45 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-28 10:30:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:30:39,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:39,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:39,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 10:30:39,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:39,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1948928856, now seen corresponding path program 1 times [2022-04-28 10:30:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:39,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947706732] [2022-04-28 10:30:39,228 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:39,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1948928856, now seen corresponding path program 2 times [2022-04-28 10:30:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841276020] [2022-04-28 10:30:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:39,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(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; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:39,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:39,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1641#true} #71#return; {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:39,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1654#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:39,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#(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; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:39,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:39,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1641#true} #71#return; {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:39,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:39,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1647#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:39,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1648#(= main_~l~0 0)} is VALID [2022-04-28 10:30:39,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {1648#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1648#(= main_~l~0 0)} is VALID [2022-04-28 10:30:39,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {1648#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1648#(= main_~l~0 0)} is VALID [2022-04-28 10:30:39,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1648#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1649#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:30:39,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {1649#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:30:39,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:30:39,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:30:39,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1651#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:30:39,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-28 10:30:39,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} ~l~0 := 1 + ~l~0; {1653#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-28 10:30:39,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {1653#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1642#false} is VALID [2022-04-28 10:30:39,667 INFO L272 TraceCheckUtils]: 22: Hoare triple {1642#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1642#false} is VALID [2022-04-28 10:30:39,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2022-04-28 10:30:39,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {1642#false} assume 0 == ~cond; {1642#false} is VALID [2022-04-28 10:30:39,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-28 10:30:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841276020] [2022-04-28 10:30:39,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841276020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:39,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87694521] [2022-04-28 10:30:39,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:39,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:39,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:30:39,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:39,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:39,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:30:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:39,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:40,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2022-04-28 10:30:40,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1641#true} is VALID [2022-04-28 10:30:40,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2022-04-28 10:30:40,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #71#return; {1641#true} is VALID [2022-04-28 10:30:40,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret5 := main(); {1641#true} is VALID [2022-04-28 10:30:40,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1641#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:40,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:40,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:40,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1684#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1684#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1701#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1721#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:30:40,421 INFO L272 TraceCheckUtils]: 22: Hoare triple {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:40,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:40,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1642#false} is VALID [2022-04-28 10:30:40,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-28 10:30:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:40,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:40,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-28 10:30:40,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1642#false} is VALID [2022-04-28 10:30:40,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:40,858 INFO L272 TraceCheckUtils]: 22: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:40,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:40,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:42,985 WARN L290 TraceCheckUtils]: 13: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:30:42,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:42,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:42,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:42,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:45,114 WARN L290 TraceCheckUtils]: 8: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-28 10:30:45,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:45,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:45,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1641#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-28 10:30:45,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret5 := main(); {1641#true} is VALID [2022-04-28 10:30:45,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #71#return; {1641#true} is VALID [2022-04-28 10:30:45,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2022-04-28 10:30:45,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1641#true} is VALID [2022-04-28 10:30:45,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2022-04-28 10:30:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 10:30:45,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87694521] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:45,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:45,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-28 10:30:45,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:45,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947706732] [2022-04-28 10:30:45,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947706732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:45,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:45,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758658868] [2022-04-28 10:30:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:30:45,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:45,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states 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 10:30:49,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:49,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:30:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:30:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:30:49,387 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states 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 10:30:51,471 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 10:30:53,771 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 10:30:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:54,106 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-28 10:30:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:30:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states 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 10:30:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-28 10:30:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states 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 10:30:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-28 10:30:54,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-28 10:30:56,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:56,338 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:30:56,338 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:30:56,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:30:56,339 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:56,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 10:30:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:30:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:30:56,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:56,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:30:56,340 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:30:56,340 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:30:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:56,340 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:30:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:30:56,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:56,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:56,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:30:56,341 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:30:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:56,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:30:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:30:56,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:56,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:56,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:56,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:30:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:30:56,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 10:30:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:56,341 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:30:56,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states 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 10:30:56,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:30:56,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:30:56,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:56,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:30:56,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:56,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:56,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:30:57,016 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L29(lines 29 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L27(lines 27 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 23 32) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L25(lines 25 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 16 37) the Hoare annotation is: true [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L23(lines 23 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 16 37) the Hoare annotation is: true [2022-04-28 10:30:57,017 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 37) the Hoare annotation is: true [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:30:57,017 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:30:57,017 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:30:57,018 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:30:57,018 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:30:57,018 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:30:57,018 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:30:57,018 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:30:57,020 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 10:30:57,022 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:30:57,025 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:30:57,026 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:30:57,027 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:30:57,028 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 10:30:57,028 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 10:30:57,031 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 10:31:01,433 INFO L163 areAnnotationChecker]: CFG has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:31:01,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:31:01 BoogieIcfgContainer [2022-04-28 10:31:01,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:31:01,442 INFO L158 Benchmark]: Toolchain (without parser) took 151046.23ms. Allocated memory was 225.4MB in the beginning and 308.3MB in the end (delta: 82.8MB). Free memory was 176.8MB in the beginning and 164.1MB in the end (delta: 12.6MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2022-04-28 10:31:01,442 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory was 192.7MB in the beginning and 192.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:31:01,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.17ms. Allocated memory is still 225.4MB. Free memory was 176.5MB in the beginning and 200.7MB in the end (delta: -24.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-28 10:31:01,442 INFO L158 Benchmark]: Boogie Preprocessor took 31.40ms. Allocated memory is still 225.4MB. Free memory was 200.7MB in the beginning and 199.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:31:01,443 INFO L158 Benchmark]: RCFGBuilder took 4655.83ms. Allocated memory is still 225.4MB. Free memory was 199.1MB in the beginning and 187.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:31:01,443 INFO L158 Benchmark]: TraceAbstraction took 146121.46ms. Allocated memory was 225.4MB in the beginning and 308.3MB in the end (delta: 82.8MB). Free memory was 187.0MB in the beginning and 164.1MB in the end (delta: 22.9MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2022-04-28 10:31:01,444 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 225.4MB. Free memory was 192.7MB in the beginning and 192.5MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.17ms. Allocated memory is still 225.4MB. Free memory was 176.5MB in the beginning and 200.7MB in the end (delta: -24.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.40ms. Allocated memory is still 225.4MB. Free memory was 200.7MB in the beginning and 199.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 4655.83ms. Allocated memory is still 225.4MB. Free memory was 199.1MB in the beginning and 187.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 146121.46ms. Allocated memory was 225.4MB in the beginning and 308.3MB in the end (delta: 82.8MB). Free memory was 187.0MB in the beginning and 164.1MB in the end (delta: 22.9MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 82.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 45.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 44.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 97 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 160 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 67 PreInvPairs, 102 NumberOfFragments, 255 HoareAnnotationTreeSize, 67 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 643 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (l % 4294967296 == (i + k + j + v3 + v4) % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:31:01,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...