/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/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:10,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:10,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:10,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:10,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:10,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:10,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:10,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:10,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:10,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:10,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:10,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:10,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:10,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:10,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:10,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:10,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:10,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:10,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:10,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:10,248 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:10,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:10,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:10,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:10,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:10,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:10,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:10,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:10,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:10,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:10,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:10,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:10,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:10,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:10,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:10,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:10,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:10,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:10,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:10,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:10,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:10,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:10,261 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 09:00:10,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:10,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:10,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:10,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:10,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:10,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:10,269 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:10,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:10,270 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:10,270 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 09:00:10,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:10,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:10,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:10,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:10,474 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:10,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-28 09:00:10,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00e200bf/f8033678a8e54267b4a2d0dc1c563275/FLAGb49931a91 [2022-04-28 09:00:10,885 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:10,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-28 09:00:10,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00e200bf/f8033678a8e54267b4a2d0dc1c563275/FLAGb49931a91 [2022-04-28 09:00:10,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00e200bf/f8033678a8e54267b4a2d0dc1c563275 [2022-04-28 09:00:10,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:10,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:10,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:10,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:10,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:10,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:10" (1/1) ... [2022-04-28 09:00:10,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6adeb52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:10, skipping insertion in model container [2022-04-28 09:00:10,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:10" (1/1) ... [2022-04-28 09:00:10,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:10,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:11,095 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/for_bounded_loop1.c[416,429] [2022-04-28 09:00:11,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,126 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:11,142 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/for_bounded_loop1.c[416,429] [2022-04-28 09:00:11,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:11,161 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:11,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11 WrapperNode [2022-04-28 09:00:11,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:11,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:11,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:11,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:11,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:11,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:11,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:11,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (1/1) ... [2022-04-28 09:00:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:11,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:11,236 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 09:00:11,254 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 09:00:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:00:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:00:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:00:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:11,318 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:11,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:11,484 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:11,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:11,489 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:00:11,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:11 BoogieIcfgContainer [2022-04-28 09:00:11,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:11,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:11,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:11,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:11,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:10" (1/3) ... [2022-04-28 09:00:11,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7294afd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:11, skipping insertion in model container [2022-04-28 09:00:11,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:11" (2/3) ... [2022-04-28 09:00:11,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7294afd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:11, skipping insertion in model container [2022-04-28 09:00:11,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:11" (3/3) ... [2022-04-28 09:00:11,505 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2022-04-28 09:00:11,514 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:11,514 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:11,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:11,547 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@47763d5b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7474e6ab [2022-04-28 09:00:11,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:00:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:00:11,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:11,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:11,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 669529748, now seen corresponding path program 1 times [2022-04-28 09:00:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870170991] [2022-04-28 09:00:11,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash 669529748, now seen corresponding path program 2 times [2022-04-28 09:00:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:11,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507413105] [2022-04-28 09:00:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:11,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 09:00:11,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 09:00:11,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-28 09:00:11,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:11,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 09:00:11,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 09:00:11,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-28 09:00:11,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2022-04-28 09:00:11,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-28 09:00:11,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 > 0);~i~0 := 0; {27#true} is VALID [2022-04-28 09:00:11,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 09:00:11,740 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {28#false} is VALID [2022-04-28 09:00:11,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 09:00:11,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 09:00:11,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 09:00:11,741 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 09:00:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:11,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507413105] [2022-04-28 09:00:11,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507413105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:11,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:11,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:11,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:11,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [870170991] [2022-04-28 09:00:11,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [870170991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:11,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:11,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108627323] [2022-04-28 09:00:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:11,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:11,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,791 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 09:00:11,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:00:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:00:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:11,815 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:11,945 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 09:00:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:00:11,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 09:00:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 09:00:11,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 09:00:12,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,042 INFO L225 Difference]: With dead ends: 41 [2022-04-28 09:00:12,042 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:00:12,045 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 09:00:12,049 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:12,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:00:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 09:00:12,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:12,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,079 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,080 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,084 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 09:00:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 09:00:12,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-28 09:00:12,085 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-28 09:00:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,092 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 09:00:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 09:00:12,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:12,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 09:00:12,097 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-28 09:00:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:12,098 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 09:00:12,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 09:00:12,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 09:00:12,127 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 09:00:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 09:00:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:00:12,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:12,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 657523975, now seen corresponding path program 1 times [2022-04-28 09:00:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502310570] [2022-04-28 09:00:12,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash 657523975, now seen corresponding path program 2 times [2022-04-28 09:00:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:12,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233899549] [2022-04-28 09:00:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {197#true} is VALID [2022-04-28 09:00:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} assume true; {197#true} is VALID [2022-04-28 09:00:12,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} #60#return; {197#true} is VALID [2022-04-28 09:00:12,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:12,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {197#true} is VALID [2022-04-28 09:00:12,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2022-04-28 09:00:12,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #60#return; {197#true} is VALID [2022-04-28 09:00:12,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret7 := main(); {197#true} is VALID [2022-04-28 09:00:12,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {197#true} is VALID [2022-04-28 09:00:12,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#true} assume !!(~n~0 > 0);~i~0 := 0; {202#(and (<= 1 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 09:00:12,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= 1 main_~n~0) (= main_~i~0 0))} assume !(~i~0 < ~n~0); {198#false} is VALID [2022-04-28 09:00:12,223 INFO L272 TraceCheckUtils]: 8: Hoare triple {198#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {198#false} is VALID [2022-04-28 09:00:12,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2022-04-28 09:00:12,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2022-04-28 09:00:12,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#false} assume !false; {198#false} is VALID [2022-04-28 09:00:12,224 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 09:00:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:12,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233899549] [2022-04-28 09:00:12,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233899549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:12,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502310570] [2022-04-28 09:00:12,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502310570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21919435] [2022-04-28 09:00:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:12,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,239 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 09:00:12,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:00:12,241 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,358 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 09:00:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:00:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 09:00:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 09:00:12,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 09:00:12,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,399 INFO L225 Difference]: With dead ends: 33 [2022-04-28 09:00:12,399 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:00:12,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:00:12,402 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:12,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:00:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-28 09:00:12,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:12,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,423 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,423 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,428 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:00:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:00:12,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:00:12,430 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:00:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,433 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:00:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:00:12,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:12,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:00:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 09:00:12,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-28 09:00:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:12,437 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 09:00:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 09:00:12,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 09:00:12,460 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 09:00:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:00:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:00:12,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:00:12,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 659251853, now seen corresponding path program 1 times [2022-04-28 09:00:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758763203] [2022-04-28 09:00:12,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 659251853, now seen corresponding path program 2 times [2022-04-28 09:00:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:12,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563875604] [2022-04-28 09:00:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:12,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-28 09:00:12,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 09:00:12,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #60#return; {368#true} is VALID [2022-04-28 09:00:12,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:12,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-28 09:00:12,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 09:00:12,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #60#return; {368#true} is VALID [2022-04-28 09:00:12,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret7 := main(); {368#true} is VALID [2022-04-28 09:00:12,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {373#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:00:12,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~n~0 > 0);~i~0 := 0; {373#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:00:12,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {374#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-28 09:00:12,562 INFO L272 TraceCheckUtils]: 8: Hoare triple {374#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {375#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:12,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {376#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:12,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {369#false} is VALID [2022-04-28 09:00:12,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-28 09:00:12,563 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 09:00:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563875604] [2022-04-28 09:00:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563875604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:12,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758763203] [2022-04-28 09:00:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758763203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:12,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:00:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477991026] [2022-04-28 09:00:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:12,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,575 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 09:00:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:00:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:00:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:00:12,576 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,857 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:00:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:00:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:00:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:00:12,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 09:00:12,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,890 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:00:12,890 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 09:00:12,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:00:12,893 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:12,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 09:00:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-28 09:00:12,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:12,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:00:12,911 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:00:12,911 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:00:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,913 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 09:00:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 09:00:12,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 09:00:12,918 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 09:00:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:12,922 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 09:00:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 09:00:12,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:12,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:12,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:12,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:00:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 09:00:12,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-04-28 09:00:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:12,926 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 09:00:12,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 09:00:12,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 09:00:12,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 09:00:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:00:12,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:12,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:12,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:00:12,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -932371294, now seen corresponding path program 1 times [2022-04-28 09:00:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:12,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066182396] [2022-04-28 09:00:12,959 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -932371294, now seen corresponding path program 2 times [2022-04-28 09:00:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:12,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170014903] [2022-04-28 09:00:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {572#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {558#true} is VALID [2022-04-28 09:00:13,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 09:00:13,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#true} {558#true} #60#return; {558#true} is VALID [2022-04-28 09:00:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 09:00:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:13,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#true} ~cond := #in~cond; {558#true} is VALID [2022-04-28 09:00:13,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume !(0 == ~cond); {558#true} is VALID [2022-04-28 09:00:13,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 09:00:13,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {564#(= main_~x~0 0)} #54#return; {564#(= main_~x~0 0)} is VALID [2022-04-28 09:00:13,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:13,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {572#(and (= |#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(20, 2);call #Ultimate.allocInit(12, 3); {558#true} is VALID [2022-04-28 09:00:13,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 09:00:13,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #60#return; {558#true} is VALID [2022-04-28 09:00:13,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret7 := main(); {558#true} is VALID [2022-04-28 09:00:13,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {563#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:00:13,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~n~0 > 0);~i~0 := 0; {563#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 09:00:13,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {564#(= main_~x~0 0)} is VALID [2022-04-28 09:00:13,107 INFO L272 TraceCheckUtils]: 8: Hoare triple {564#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {558#true} is VALID [2022-04-28 09:00:13,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#true} ~cond := #in~cond; {558#true} is VALID [2022-04-28 09:00:13,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#true} assume !(0 == ~cond); {558#true} is VALID [2022-04-28 09:00:13,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 09:00:13,108 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {558#true} {564#(= main_~x~0 0)} #54#return; {564#(= main_~x~0 0)} is VALID [2022-04-28 09:00:13,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {564#(= main_~x~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~y~0 := #t~nondet6;havoc #t~nondet6; {564#(= main_~x~0 0)} is VALID [2022-04-28 09:00:13,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#(= main_~x~0 0)} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {569#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-28 09:00:13,110 INFO L272 TraceCheckUtils]: 15: Hoare triple {569#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {570#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:00:13,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {571#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:00:13,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {559#false} is VALID [2022-04-28 09:00:13,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-28 09:00:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:13,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170014903] [2022-04-28 09:00:13,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170014903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:13,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:13,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066182396] [2022-04-28 09:00:13,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066182396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:13,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:13,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325068543] [2022-04-28 09:00:13,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:13,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:00:13,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:13,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,131 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 09:00:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:00:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:00:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:00:13,134 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,493 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 09:00:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:00:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:00:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 09:00:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 09:00:13,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-28 09:00:13,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,533 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:00:13,533 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 09:00:13,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:13,534 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:13,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 09:00:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-28 09:00:13,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:13,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:00:13,553 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:00:13,553 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:00:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,554 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 09:00:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 09:00:13,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 09:00:13,555 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 09:00:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:13,556 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 09:00:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 09:00:13,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:13,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:13,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:13,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:00:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 09:00:13,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2022-04-28 09:00:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:13,558 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 09:00:13,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:00:13,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 09:00:13,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 09:00:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:00:13,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:13,590 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:13,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:00:13,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1861509246, now seen corresponding path program 1 times [2022-04-28 09:00:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525425606] [2022-04-28 09:00:13,736 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:00:13,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1861509246, now seen corresponding path program 2 times [2022-04-28 09:00:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:13,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472728527] [2022-04-28 09:00:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:00:13,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:00:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:00:13,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:00:13,797 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:00:13,802 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:00:13,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:00:13,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 09:00:13,818 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-28 09:00:13,821 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:00:13,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-28 09:00:13,833 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 09:00:13,834 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 09:00:13,834 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:00:13,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:00:13 BoogieIcfgContainer [2022-04-28 09:00:13,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:00:13,836 INFO L158 Benchmark]: Toolchain (without parser) took 2935.16ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 157.9MB in the beginning and 116.5MB in the end (delta: 41.4MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. [2022-04-28 09:00:13,836 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 185.6MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:00:13,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.49ms. Allocated memory is still 185.6MB. Free memory was 157.9MB in the beginning and 156.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-28 09:00:13,836 INFO L158 Benchmark]: Boogie Preprocessor took 39.47ms. Allocated memory is still 185.6MB. Free memory was 156.0MB in the beginning and 154.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:00:13,836 INFO L158 Benchmark]: RCFGBuilder took 287.20ms. Allocated memory is still 185.6MB. Free memory was 154.4MB in the beginning and 142.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:00:13,837 INFO L158 Benchmark]: TraceAbstraction took 2343.53ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 142.4MB in the beginning and 116.5MB in the end (delta: 25.9MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. [2022-04-28 09:00:13,837 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.15ms. Allocated memory is still 185.6MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.49ms. Allocated memory is still 185.6MB. Free memory was 157.9MB in the beginning and 156.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.47ms. Allocated memory is still 185.6MB. Free memory was 156.0MB in the beginning and 154.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.20ms. Allocated memory is still 185.6MB. Free memory was 154.4MB in the beginning and 142.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2343.53ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 142.4MB in the beginning and 116.5MB in the end (delta: 25.9MB). Peak memory consumption was 63.6MB. 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 - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 [L22] COND TRUE i