/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/loopv1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:09:15,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:09:15,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:09:15,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:09:15,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:09:15,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:09:15,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:09:15,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:09:15,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:09:15,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:09:15,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:09:15,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:09:15,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:09:15,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:09:15,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:09:15,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:09:15,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:09:15,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:09:15,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:09:15,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:09:15,709 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:09:15,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:09:15,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:09:15,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:09:15,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:09:15,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:09:15,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:09:15,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:09:15,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:09:15,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:09:15,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:09:15,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:09:15,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:09:15,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:09:15,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:09:15,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:09:15,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:09:15,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:09:15,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:09:15,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:09:15,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:09:15,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:09:15,725 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:09:15,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:09:15,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:09:15,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:09:15,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:09:15,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:09:15,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:09:15,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:09:15,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:09:15,736 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:09:15,736 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:09:15,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:09:15,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:09:15,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:09:15,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:09:15,964 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:09:15,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv1.c [2022-04-28 10:09:16,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0325116/32fb6a46053b41cbb0c5e88961eb13ed/FLAGd483cf659 [2022-04-28 10:09:16,335 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:09:16,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv1.c [2022-04-28 10:09:16,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0325116/32fb6a46053b41cbb0c5e88961eb13ed/FLAGd483cf659 [2022-04-28 10:09:16,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0325116/32fb6a46053b41cbb0c5e88961eb13ed [2022-04-28 10:09:16,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:09:16,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:09:16,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:09:16,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:09:16,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:09:16,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be5059e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16, skipping insertion in model container [2022-04-28 10:09:16,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:09:16,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:09:16,911 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/loopv1.c[456,469] [2022-04-28 10:09:16,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:09:16,924 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:09:16,932 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/loopv1.c[456,469] [2022-04-28 10:09:16,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:09:16,966 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:09:16,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16 WrapperNode [2022-04-28 10:09:16,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:09:16,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:09:16,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:09:16,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:09:16,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:09:16,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:09:16,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:09:16,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:09:16,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (1/1) ... [2022-04-28 10:09:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:09:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:17,014 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:09:17,031 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:09:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:09:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:09:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:09:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:09:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:09:17,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:09:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:09:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:09:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:09:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:09:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:09:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:09:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:09:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:09:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:09:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:09:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:09:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:09:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:09:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:09:17,100 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:09:17,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:09:17,288 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:09:17,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:09:17,294 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:09:17,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:09:17 BoogieIcfgContainer [2022-04-28 10:09:17,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:09:17,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:09:17,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:09:17,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:09:17,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:09:16" (1/3) ... [2022-04-28 10:09:17,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba6f49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:09:17, skipping insertion in model container [2022-04-28 10:09:17,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:09:16" (2/3) ... [2022-04-28 10:09:17,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba6f49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:09:17, skipping insertion in model container [2022-04-28 10:09:17,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:09:17" (3/3) ... [2022-04-28 10:09:17,301 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv1.c [2022-04-28 10:09:17,310 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:09:17,310 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:09:17,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:09:17,391 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@159c2cbc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32de98de [2022-04-28 10:09:17,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:09:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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:09:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:09:17,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:17,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:17,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1965397839, now seen corresponding path program 1 times [2022-04-28 10:09:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484478417] [2022-04-28 10:09:17,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:09:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1965397839, now seen corresponding path program 2 times [2022-04-28 10:09:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:17,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4586472] [2022-04-28 10:09:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,712 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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {24#true} is VALID [2022-04-28 10:09:17,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:09:17,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-28 10:09:17,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#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:09:17,715 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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {24#true} is VALID [2022-04-28 10:09:17,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:09:17,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-28 10:09:17,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 10:09:17,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-28 10:09:17,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {29#(= main_~i~0 0)} is VALID [2022-04-28 10:09:17,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {29#(= main_~i~0 0)} is VALID [2022-04-28 10:09:17,717 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#(= main_~i~0 0)} call __VERIFIER_assert((if 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3) then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:17,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:17,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:09:17,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:09:17,719 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:09:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4586472] [2022-04-28 10:09:17,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4586472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:17,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:17,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:17,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484478417] [2022-04-28 10:09:17,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484478417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028925115] [2022-04-28 10:09:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:09:17,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:17,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:17,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:09:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:09:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:09:17,781 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,051 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-28 10:09:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:09:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 10:09:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 10:09:18,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-28 10:09:18,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,119 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:09:18,119 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:09:18,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:18,125 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:18,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:09:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 10:09:18,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:18,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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:09:18,146 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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:09:18,146 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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:09:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,154 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:09:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:09:18,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:18,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:18,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:09:18,155 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:09:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,157 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:09:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:09:18,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:18,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:18,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:18,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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:09:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:09:18,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 10:09:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:18,160 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:09:18,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:09:18,189 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:09:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:09:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:09:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:18,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:09:18,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2050700910, now seen corresponding path program 1 times [2022-04-28 10:09:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945230278] [2022-04-28 10:09:18,212 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:18,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2050700910, now seen corresponding path program 2 times [2022-04-28 10:09:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887088804] [2022-04-28 10:09:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {191#true} is VALID [2022-04-28 10:09:18,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 10:09:18,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} #55#return; {191#true} is VALID [2022-04-28 10:09:18,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {200#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:18,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {191#true} is VALID [2022-04-28 10:09:18,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 10:09:18,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #55#return; {191#true} is VALID [2022-04-28 10:09:18,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret6 := main(); {191#true} is VALID [2022-04-28 10:09:18,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {191#true} is VALID [2022-04-28 10:09:18,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {196#(= main_~i~0 0)} is VALID [2022-04-28 10:09:18,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {196#(= main_~i~0 0)} is VALID [2022-04-28 10:09:18,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#(= main_~i~0 0)} assume 0 != #t~nondet5;havoc #t~nondet5;~i~0 := 6 + ~i~0; {197#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} is VALID [2022-04-28 10:09:18,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} assume !(~i~0 < ~n~0); {197#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} is VALID [2022-04-28 10:09:18,421 INFO L272 TraceCheckUtils]: 10: Hoare triple {197#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} call __VERIFIER_assert((if 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3) then 1 else 0)); {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:18,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:18,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {192#false} is VALID [2022-04-28 10:09:18,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 10:09:18,423 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:09:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887088804] [2022-04-28 10:09:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887088804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197754976] [2022-04-28 10:09:18,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:18,425 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:09:18,449 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:09:18,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:18,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:18,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:09:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:18,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 10:09:18,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {191#true} is VALID [2022-04-28 10:09:18,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 10:09:18,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #55#return; {191#true} is VALID [2022-04-28 10:09:18,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret6 := main(); {191#true} is VALID [2022-04-28 10:09:18,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {191#true} is VALID [2022-04-28 10:09:18,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {196#(= main_~i~0 0)} is VALID [2022-04-28 10:09:18,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {196#(= main_~i~0 0)} is VALID [2022-04-28 10:09:18,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#(= main_~i~0 0)} assume 0 != #t~nondet5;havoc #t~nondet5;~i~0 := 6 + ~i~0; {228#(= main_~i~0 6)} is VALID [2022-04-28 10:09:18,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(= main_~i~0 6)} assume !(~i~0 < ~n~0); {228#(= main_~i~0 6)} is VALID [2022-04-28 10:09:18,618 INFO L272 TraceCheckUtils]: 10: Hoare triple {228#(= main_~i~0 6)} call __VERIFIER_assert((if 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3) then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:18,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:18,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 10:09:18,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 10:09:18,619 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:09:18,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:18,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 10:09:18,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 10:09:18,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:18,818 INFO L272 TraceCheckUtils]: 10: Hoare triple {255#(= (mod main_~i~0 3) 0)} call __VERIFIER_assert((if 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3) then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:18,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#(= (mod main_~i~0 3) 0)} assume !(~i~0 < ~n~0); {255#(= (mod main_~i~0 3) 0)} is VALID [2022-04-28 10:09:18,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(= (mod main_~i~0 3) 0)} assume 0 != #t~nondet5;havoc #t~nondet5;~i~0 := 6 + ~i~0; {255#(= (mod main_~i~0 3) 0)} is VALID [2022-04-28 10:09:18,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(= (mod main_~i~0 3) 0)} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {255#(= (mod main_~i~0 3) 0)} is VALID [2022-04-28 10:09:18,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} assume !!(~n~0 <= ~SIZE~0);~i~0 := 0;~j~0 := 0; {255#(= (mod main_~i~0 3) 0)} is VALID [2022-04-28 10:09:18,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {191#true} is VALID [2022-04-28 10:09:18,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret6 := main(); {191#true} is VALID [2022-04-28 10:09:18,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #55#return; {191#true} is VALID [2022-04-28 10:09:18,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 10:09:18,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {191#true} is VALID [2022-04-28 10:09:18,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 10:09:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:09:18,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197754976] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:09:18,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-28 10:09:18,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:18,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945230278] [2022-04-28 10:09:18,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945230278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:18,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:18,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755256037] [2022-04-28 10:09:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:09:18,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:18,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:09:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:09:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:09:18,837 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,888 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:09:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:09:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:09:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-28 10:09:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-28 10:09:18,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-04-28 10:09:18,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,900 INFO L225 Difference]: With dead ends: 15 [2022-04-28 10:09:18,900 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:09:18,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:18,902 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:18,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:09:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:09:18,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:18,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:09:18,903 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:09:18,903 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:09:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,903 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:09:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:09:18,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:18,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:18,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:09:18,904 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:09:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,904 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:09:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:09:18,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:18,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:18,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:18,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:09:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:09:18,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 10:09:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:09:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:18,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:09:18,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:09:18,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:18,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:09:18,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:09:19,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:19,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:09:19,197 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:09:19,198 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L895 garLoopResultBuilder]: At program point L27(lines 27 30) the Hoare annotation is: (= (mod main_~i~0 3) 0) [2022-04-28 10:09:19,199 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 25 31) the Hoare annotation is: (= (mod main_~i~0 3) 0) [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 34) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 31) the Hoare annotation is: (= (mod main_~i~0 3) 0) [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 34) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,199 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:09:19,199 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-28 10:09:19,200 INFO L895 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:09:19,200 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 15) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 10:09:19,200 INFO L895 garLoopResultBuilder]: At program point L13-2(lines 12 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:09:19,200 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:09:19,201 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:09:19,203 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 10:09:19,205 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:09:19,212 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:09:19,213 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:09:19,214 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:09:19,214 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:09:19,214 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:09:19,216 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 10:09:19,218 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:09:19,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:09:19 BoogieIcfgContainer [2022-04-28 10:09:19,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:09:19,227 INFO L158 Benchmark]: Toolchain (without parser) took 2453.30ms. Allocated memory was 182.5MB in the beginning and 308.3MB in the end (delta: 125.8MB). Free memory was 127.3MB in the beginning and 152.0MB in the end (delta: -24.7MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2022-04-28 10:09:19,228 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:09:19,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.01ms. Allocated memory was 182.5MB in the beginning and 308.3MB in the end (delta: 125.8MB). Free memory was 127.1MB in the beginning and 282.5MB in the end (delta: -155.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 10:09:19,228 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 308.3MB. Free memory was 282.0MB in the beginning and 280.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:09:19,228 INFO L158 Benchmark]: RCFGBuilder took 303.23ms. Allocated memory is still 308.3MB. Free memory was 280.8MB in the beginning and 268.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 10:09:19,229 INFO L158 Benchmark]: TraceAbstraction took 1929.84ms. Allocated memory is still 308.3MB. Free memory was 267.9MB in the beginning and 152.0MB in the end (delta: 115.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2022-04-28 10:09:19,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.01ms. Allocated memory was 182.5MB in the beginning and 308.3MB in the end (delta: 125.8MB). Free memory was 127.1MB in the beginning and 282.5MB in the end (delta: -155.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 308.3MB. Free memory was 282.0MB in the beginning and 280.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 303.23ms. Allocated memory is still 308.3MB. Free memory was 280.8MB in the beginning and 268.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1929.84ms. Allocated memory is still 308.3MB. Free memory was 267.9MB in the beginning and 152.0MB in the end (delta: 115.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 24 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 48 NumberOfFragments, 76 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: i % 3 == 0 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:09:19,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...