/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:25:35,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:25:35,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:25:35,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:25:35,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:25:35,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:25:35,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:25:35,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:25:35,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:25:35,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:25:35,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:25:35,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:25:35,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:25:35,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:25:35,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:25:35,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:25:35,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:25:35,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:25:35,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:25:35,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:25:35,529 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:25:35,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:25:35,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:25:35,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:25:35,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:25:35,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:25:35,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:25:35,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:25:35,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:25:35,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:25:35,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:25:35,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:25:35,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:25:35,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:25:35,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:25:35,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:25:35,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:25:35,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:25:35,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:25:35,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:25:35,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:25:35,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:25:35,563 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:25:35,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:25:35,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:25:35,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:25:35,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:25:35,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:25:35,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:25:35,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:25:35,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:25:35,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:25:35,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:25:35,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:25:35,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:25:35,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:25:35,580 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:25:35,580 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:25:35,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:25:35,580 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:25:35,580 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:25:35,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:25:35,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:25:35,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:25:35,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:25:35,822 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:25:35,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-28 10:25:35,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddae79825/b62cb53750964dc4aa3c3d7dadf2b4e2/FLAGbfc0d38f3 [2022-04-28 10:25:36,226 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:25:36,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-28 10:25:36,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddae79825/b62cb53750964dc4aa3c3d7dadf2b4e2/FLAGbfc0d38f3 [2022-04-28 10:25:36,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddae79825/b62cb53750964dc4aa3c3d7dadf2b4e2 [2022-04-28 10:25:36,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:25:36,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:25:36,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:25:36,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:25:36,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:25:36,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20876bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36, skipping insertion in model container [2022-04-28 10:25:36,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:25:36,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:25:36,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-04-28 10:25:36,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:25:36,848 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:25:36,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-04-28 10:25:36,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:25:36,889 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:25:36,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36 WrapperNode [2022-04-28 10:25:36,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:25:36,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:25:36,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:25:36,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:25:36,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:25:36,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:25:36,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:25:36,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:25:36,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (1/1) ... [2022-04-28 10:25:36,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:25:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:25:36,963 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:25:36,981 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:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:25:36,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:25:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:25:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:25:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:25:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:25:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:25:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:25:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:25:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:25:37,058 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:25:37,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:25:37,241 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:25:37,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:25:37,247 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:25:37,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:25:37 BoogieIcfgContainer [2022-04-28 10:25:37,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:25:37,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:25:37,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:25:37,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:25:37,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:25:36" (1/3) ... [2022-04-28 10:25:37,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37126fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:25:37, skipping insertion in model container [2022-04-28 10:25:37,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:25:36" (2/3) ... [2022-04-28 10:25:37,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37126fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:25:37, skipping insertion in model container [2022-04-28 10:25:37,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:25:37" (3/3) ... [2022-04-28 10:25:37,255 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-28 10:25:37,266 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:25:37,266 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:25:37,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:25:37,306 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@5ad45a7b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69433bc9 [2022-04-28 10:25:37,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:25:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:25:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:25:37,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:37,319 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:25:37,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-28 10:25:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:37,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [514180217] [2022-04-28 10:25:37,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:25:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 2 times [2022-04-28 10:25:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:37,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620975317] [2022-04-28 10:25:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:37,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:37,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-28 10:25:37,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:25:37,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-28 10:25:37,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:37,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-28 10:25:37,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:25:37,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-28 10:25:37,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-28 10:25:37,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-28 10:25:37,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {27#true} is VALID [2022-04-28 10:25:37,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-28 10:25:37,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {27#true} is VALID [2022-04-28 10:25:37,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-28 10:25:37,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} ~k~0 := ~j~0; {27#true} is VALID [2022-04-28 10:25:37,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 10:25:37,576 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 10:25:37,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 10:25:37,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 10:25:37,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 10:25:37,577 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:25:37,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:37,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620975317] [2022-04-28 10:25:37,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620975317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:37,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:37,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:25:37,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:25:37,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [514180217] [2022-04-28 10:25:37,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [514180217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:37,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:37,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:25:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255424435] [2022-04-28 10:25:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:25:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:25:37,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:25:37,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:37,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:25:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:25:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:25:37,645 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:37,767 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-28 10:25:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:25:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:25:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:25:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 10:25:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 10:25:37,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-28 10:25:37,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:37,847 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:25:37,847 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:25:37,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:25:37,852 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:25:37,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:25:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:25:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:25:37,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:25:37,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,878 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,879 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:37,881 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:25:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:25:37,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:37,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:37,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:25:37,882 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:25:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:37,885 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:25:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:25:37,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:37,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:37,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:25:37,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:25:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:25:37,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-28 10:25:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:25:37,889 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:25:37,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:37,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:25:37,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:25:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:25:37,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:37,921 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:25:37,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:25:37,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-28 10:25:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:37,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123749096] [2022-04-28 10:25:37,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:25:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 2 times [2022-04-28 10:25:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606228973] [2022-04-28 10:25:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:38,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:38,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:38,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:38,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:38,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:38,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:38,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 10:25:38,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 10:25:38,570 INFO L272 TraceCheckUtils]: 12: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:25:38,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:25:38,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {184#false} is VALID [2022-04-28 10:25:38,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-28 10:25:38,572 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:25:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:38,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606228973] [2022-04-28 10:25:38,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606228973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:38,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:38,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:25:38,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:25:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123749096] [2022-04-28 10:25:38,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123749096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:38,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:38,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:25:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457284496] [2022-04-28 10:25:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:25:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:25:38,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:25:38,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:40,678 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:25:40,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:25:40,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:25:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:25:40,680 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,251 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-28 10:25:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:25:41,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:25:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:25:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:25:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:25:41,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 10:25:41,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:41,309 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:25:41,309 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:25:41,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:25:41,310 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:25:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:25:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:25:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-28 10:25:41,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:25:41,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,346 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,346 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,348 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-28 10:25:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:25:41,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:41,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:41,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:25:41,350 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:25:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,351 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-28 10:25:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:25:41,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:41,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:41,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:25:41,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:25:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-28 10:25:41,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-28 10:25:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:25:41,354 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-28 10:25:41,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-28 10:25:41,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 10:25:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:25:41,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:41,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:25:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:25:41,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-28 10:25:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039245251] [2022-04-28 10:25:41,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:25:41,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:25:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 2 times [2022-04-28 10:25:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:41,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909643124] [2022-04-28 10:25:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:41,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {375#true} is VALID [2022-04-28 10:25:41,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2022-04-28 10:25:41,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #75#return; {375#true} is VALID [2022-04-28 10:25:41,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {382#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:41,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {375#true} is VALID [2022-04-28 10:25:41,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2022-04-28 10:25:41,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#true} {375#true} #75#return; {375#true} is VALID [2022-04-28 10:25:41,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2022-04-28 10:25:41,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {375#true} is VALID [2022-04-28 10:25:41,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {375#true} is VALID [2022-04-28 10:25:41,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {375#true} is VALID [2022-04-28 10:25:41,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {375#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {375#true} is VALID [2022-04-28 10:25:41,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {380#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-28 10:25:41,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} ~k~0 := ~j~0; {381#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 10:25:41,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} assume !!(~k~0 % 4294967296 < ~n~0 % 4294967296);~k~0 := 1 + ~k~0; {376#false} is VALID [2022-04-28 10:25:41,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {376#false} is VALID [2022-04-28 10:25:41,555 INFO L272 TraceCheckUtils]: 13: Hoare triple {376#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {376#false} is VALID [2022-04-28 10:25:41,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#false} ~cond := #in~cond; {376#false} is VALID [2022-04-28 10:25:41,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#false} assume 0 == ~cond; {376#false} is VALID [2022-04-28 10:25:41,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-04-28 10:25:41,556 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:25:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909643124] [2022-04-28 10:25:41,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909643124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:41,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:41,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:25:41,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:25:41,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039245251] [2022-04-28 10:25:41,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039245251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:41,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:41,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:25:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012388358] [2022-04-28 10:25:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:25:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:25:41,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:25:41,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:41,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:41,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:25:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:25:41,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:25:41,605 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,809 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 10:25:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:25:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:25:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:25:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 10:25:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 10:25:41,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 10:25:41,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:41,840 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:25:41,840 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:25:41,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:25:41,842 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:25:41,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:25:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:25:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 10:25:41,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:25:41,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,870 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,870 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,871 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 10:25:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:25:41,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:41,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:41,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:25:41,872 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:25:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:41,873 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 10:25:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:25:41,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:41,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:41,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:25:41,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:25:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 10:25:41,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-28 10:25:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:25:41,875 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 10:25:41,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:41,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 10:25:41,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:25:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:25:41,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:41,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:25:41,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:25:41,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1916237745, now seen corresponding path program 1 times [2022-04-28 10:25:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941578833] [2022-04-28 10:25:41,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:25:41,909 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:25:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1916237745, now seen corresponding path program 2 times [2022-04-28 10:25:41,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:41,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704831251] [2022-04-28 10:25:41,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:42,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {525#true} is VALID [2022-04-28 10:25:42,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} assume true; {525#true} is VALID [2022-04-28 10:25:42,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} #75#return; {525#true} is VALID [2022-04-28 10:25:42,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {525#true} call ULTIMATE.init(); {532#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:42,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {525#true} is VALID [2022-04-28 10:25:42,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} assume true; {525#true} is VALID [2022-04-28 10:25:42,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {525#true} {525#true} #75#return; {525#true} is VALID [2022-04-28 10:25:42,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {525#true} call #t~ret5 := main(); {525#true} is VALID [2022-04-28 10:25:42,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {525#true} is VALID [2022-04-28 10:25:42,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {525#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {530#(= main_~i~0 0)} is VALID [2022-04-28 10:25:42,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {531#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-28 10:25:42,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {531#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {531#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-28 10:25:42,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {531#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {526#false} is VALID [2022-04-28 10:25:42,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {526#false} is VALID [2022-04-28 10:25:42,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {526#false} ~k~0 := ~j~0; {526#false} is VALID [2022-04-28 10:25:42,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {526#false} is VALID [2022-04-28 10:25:42,008 INFO L272 TraceCheckUtils]: 13: Hoare triple {526#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {526#false} is VALID [2022-04-28 10:25:42,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {526#false} ~cond := #in~cond; {526#false} is VALID [2022-04-28 10:25:42,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {526#false} assume 0 == ~cond; {526#false} is VALID [2022-04-28 10:25:42,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {526#false} assume !false; {526#false} is VALID [2022-04-28 10:25:42,009 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:25:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704831251] [2022-04-28 10:25:42,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704831251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:42,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:42,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:25:42,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:25:42,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941578833] [2022-04-28 10:25:42,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941578833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:25:42,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:25:42,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:25:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265781835] [2022-04-28 10:25:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:25:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:25:42,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:25:42,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:42,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:42,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:25:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:42,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:25:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:25:42,040 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:42,185 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 10:25:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:25:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-28 10:25:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:25:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 10:25:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 10:25:42,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 10:25:42,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:42,229 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:25:42,229 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:25:42,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:25:42,231 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:25:42,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:25:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:25:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:25:42,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:25:42,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:42,265 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:42,265 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:42,268 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 10:25:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:25:42,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:42,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:42,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:25:42,269 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:25:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:25:42,278 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 10:25:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:25:42,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:25:42,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:25:42,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:25:42,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:25:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:25:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 10:25:42,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-04-28 10:25:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:25:42,282 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 10:25:42,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:25:42,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 10:25:42,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:25:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:25:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:25:42,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:25:42,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:25:42,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:25:42,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:25:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:25:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-04-28 10:25:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:25:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205436161] [2022-04-28 10:25:42,317 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:25:42,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:25:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 2 times [2022-04-28 10:25:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:25:42,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255311161] [2022-04-28 10:25:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:25:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:25:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:25:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:44,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {667#true} #75#return; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {679#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:25:44,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {667#true} #75#return; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:44,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {673#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-28 10:25:44,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {673#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {674#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {674#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {675#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {675#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {676#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {676#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {676#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 10:25:44,911 INFO L272 TraceCheckUtils]: 13: Hoare triple {676#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {677#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:25:44,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {678#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:25:44,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {668#false} is VALID [2022-04-28 10:25:44,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-28 10:25:44,913 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:25:44,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:25:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255311161] [2022-04-28 10:25:44,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255311161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:25:44,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417437737] [2022-04-28 10:25:44,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:25:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:25:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:25:44,919 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:25:44,954 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:25:44,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:25:44,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:25:44,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:25:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:25:45,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:25:46,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2022-04-28 10:25:46,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:46,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:46,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {667#true} #75#return; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:46,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:46,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:25:46,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {701#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-28 10:25:46,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {705#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:25:46,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< 0 (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {709#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} is VALID [2022-04-28 10:25:46,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {713#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-28 10:25:46,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {713#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-28 10:25:46,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} ~k~0 := ~j~0; {720#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-28 10:25:46,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {720#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-28 10:25:46,964 INFO L272 TraceCheckUtils]: 13: Hoare triple {720#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:25:46,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:25:46,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {668#false} is VALID [2022-04-28 10:25:46,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-28 10:25:46,966 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:25:46,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:26:17,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-28 10:26:17,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {668#false} is VALID [2022-04-28 10:26:17,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:26:17,413 INFO L272 TraceCheckUtils]: 13: Hoare triple {747#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:26:17,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {747#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {747#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-28 10:26:17,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~k~0 := ~j~0; {747#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-28 10:26:17,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {754#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-28 10:26:17,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {761#(<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {754#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-28 10:26:17,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {761#(<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-28 10:26:19,562 WARN L290 TraceCheckUtils]: 7: Hoare triple {769#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {765#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is UNKNOWN [2022-04-28 10:26:19,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {769#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:26:19,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {667#true} is VALID [2022-04-28 10:26:19,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret5 := main(); {667#true} is VALID [2022-04-28 10:26:19,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #75#return; {667#true} is VALID [2022-04-28 10:26:19,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2022-04-28 10:26:19,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {667#true} is VALID [2022-04-28 10:26:19,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2022-04-28 10:26:19,564 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:26:19,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417437737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:26:19,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:26:19,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-04-28 10:26:19,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:26:19,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205436161] [2022-04-28 10:26:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205436161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:26:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:26:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:26:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591687056] [2022-04-28 10:26:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:26:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:26:19,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:26:19,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:21,718 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:26:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:26:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:26:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=367, Unknown=6, NotChecked=0, Total=462 [2022-04-28 10:26:21,719 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:26,963 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 10:26:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:26:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:26:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:26:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-28 10:26:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-28 10:26:26,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2022-04-28 10:26:29,127 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:26:29,127 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:26:29,128 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:26:29,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=159, Invalid=646, Unknown=7, NotChecked=0, Total=812 [2022-04-28 10:26:29,129 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:26:29,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 29 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:26:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:26:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-28 10:26:29,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:26:29,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:26:29,164 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:26:29,165 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:26:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:29,166 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 10:26:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 10:26:29,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:29,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:29,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 25 states. [2022-04-28 10:26:29,167 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 25 states. [2022-04-28 10:26:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:26:29,172 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 10:26:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 10:26:29,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:26:29,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:26:29,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:26:29,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:26:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:26:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 10:26:29,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-28 10:26:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:26:29,173 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 10:26:29,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:26:29,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 10:26:29,207 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:26:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 10:26:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:26:29,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:26:29,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:26:29,215 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:26:29,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:29,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:26:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:26:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374134, now seen corresponding path program 1 times [2022-04-28 10:26:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:26:29,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [20848478] [2022-04-28 10:26:29,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:26:29,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:26:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374134, now seen corresponding path program 2 times [2022-04-28 10:26:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:26:29,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595024159] [2022-04-28 10:26:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:26:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:26:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:26:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:26:29,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {972#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {963#true} is VALID [2022-04-28 10:26:29,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#true} assume true; {963#true} is VALID [2022-04-28 10:26:29,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {963#true} {963#true} #75#return; {963#true} is VALID [2022-04-28 10:26:29,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {972#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:26:29,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {963#true} is VALID [2022-04-28 10:26:29,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2022-04-28 10:26:29,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #75#return; {963#true} is VALID [2022-04-28 10:26:29,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret5 := main(); {963#true} is VALID [2022-04-28 10:26:29,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {963#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {963#true} is VALID [2022-04-28 10:26:29,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {963#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {968#(= main_~i~0 0)} is VALID [2022-04-28 10:26:29,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {969#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:26:29,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {970#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:26:29,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {970#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {971#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-28 10:26:29,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {964#false} is VALID [2022-04-28 10:26:29,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {964#false} is VALID [2022-04-28 10:26:29,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {964#false} ~k~0 := ~j~0; {964#false} is VALID [2022-04-28 10:26:29,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {964#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {964#false} is VALID [2022-04-28 10:26:29,636 INFO L272 TraceCheckUtils]: 14: Hoare triple {964#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {964#false} is VALID [2022-04-28 10:26:29,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {964#false} ~cond := #in~cond; {964#false} is VALID [2022-04-28 10:26:29,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {964#false} assume 0 == ~cond; {964#false} is VALID [2022-04-28 10:26:29,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {964#false} assume !false; {964#false} is VALID [2022-04-28 10:26:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:26:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:26:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595024159] [2022-04-28 10:26:29,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595024159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:26:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008122068] [2022-04-28 10:26:29,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:26:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:26:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:26:29,642 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:26:29,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process