/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/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:39:31,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:39:31,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:39:31,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:39:31,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:39:31,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:39:31,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:39:31,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:39:31,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:39:31,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:39:31,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:39:31,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:39:31,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:39:31,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:39:31,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:39:31,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:39:31,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:39:31,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:39:31,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:39:31,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:39:31,937 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:39:31,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:39:31,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:39:31,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:39:31,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:39:31,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:39:31,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:39:31,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:39:31,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:39:31,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:39:31,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:39:31,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:39:31,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:39:31,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:39:31,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:39:31,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:39:31,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:39:31,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:39:31,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:39:31,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:39:31,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:39:31,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:39:31,949 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:39:31,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:39:31,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:39:31,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:39:31,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:39:31,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:39:31,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:39:31,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:39:31,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:39:31,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:39:31,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:39:31,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:31,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:39:31,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:39:31,959 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:39:31,960 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:39:31,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:39:31,960 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:39:31,960 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:39:32,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:39:32,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:39:32,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:39:32,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:39:32,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:39:32,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-28 09:39:32,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2e58e45/3620fd32f3064ee299da4b361d8f2fc8/FLAG3c5239821 [2022-04-28 09:39:32,518 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:39:32,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-28 09:39:32,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2e58e45/3620fd32f3064ee299da4b361d8f2fc8/FLAG3c5239821 [2022-04-28 09:39:32,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2e58e45/3620fd32f3064ee299da4b361d8f2fc8 [2022-04-28 09:39:32,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:39:32,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:39:32,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:32,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:39:32,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:39:32,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:32" (1/1) ... [2022-04-28 09:39:32,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218abec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:32, skipping insertion in model container [2022-04-28 09:39:32,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:32" (1/1) ... [2022-04-28 09:39:32,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:39:32,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:39:33,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i[895,908] [2022-04-28 09:39:33,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:33,199 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:39:33,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i[895,908] [2022-04-28 09:39:33,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:33,233 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:39:33,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33 WrapperNode [2022-04-28 09:39:33,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:33,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:39:33,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:39:33,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:39:33,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:39:33,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:39:33,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:39:33,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:39:33,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (1/1) ... [2022-04-28 09:39:33,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:33,303 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:39:33,315 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:39:33,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:39:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:39:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:39:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:39:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:39:33,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:39:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:39:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:39:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:39:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:39:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:39:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:39:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:39:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:39:33,391 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:39:33,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:39:33,462 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:39:33,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:39:33,467 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:39:33,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:33 BoogieIcfgContainer [2022-04-28 09:39:33,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:39:33,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:39:33,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:39:33,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:39:33,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:39:32" (1/3) ... [2022-04-28 09:39:33,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db18fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:33, skipping insertion in model container [2022-04-28 09:39:33,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:33" (2/3) ... [2022-04-28 09:39:33,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db18fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:33, skipping insertion in model container [2022-04-28 09:39:33,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:33" (3/3) ... [2022-04-28 09:39:33,475 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2022-04-28 09:39:33,487 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:39:33,487 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:39:33,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:39:33,523 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@2ff61292, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35945576 [2022-04-28 09:39:33,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:39:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:39:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:39:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:33,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:33,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 1 times [2022-04-28 09:39:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816468309] [2022-04-28 09:39:33,554 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 2 times [2022-04-28 09:39:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:33,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713220525] [2022-04-28 09:39:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:33,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:33,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(9, 2); {22#true} is VALID [2022-04-28 09:39:33,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:39:33,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-28 09:39:33,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:33,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(9, 2); {22#true} is VALID [2022-04-28 09:39:33,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:39:33,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-28 09:39:33,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2022-04-28 09:39:33,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:39:33,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 >= ~i~0); {23#false} is VALID [2022-04-28 09:39:33,750 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {23#false} is VALID [2022-04-28 09:39:33,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 09:39:33,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 09:39:33,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 09:39:33,753 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:39:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713220525] [2022-04-28 09:39:33,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713220525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:33,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:33,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:33,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816468309] [2022-04-28 09:39:33,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816468309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:33,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:33,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:39:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99250086] [2022-04-28 09:39:33,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-28 09:39:33,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:33,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:39:33,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:39:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:39:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:39:33,826 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:39:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:33,979 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 09:39:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:39:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-28 09:39:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:39:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 09:39:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:39:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 09:39:34,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 09:39:34,059 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:39:34,065 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:39:34,066 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 09:39:34,068 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:39:34,071 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:34,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 09:39:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 09:39:34,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:34,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,099 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,100 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:34,107 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:39:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:39:34,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:34,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:34,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:39:34,109 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:39:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:34,113 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:39:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:39:34,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:34,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:34,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:34,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 09:39:34,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 09:39:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:34,116 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 09:39:34,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:39:34,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 09:39:34,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:39:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:39:34,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:34,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:34,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:39:34,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 1 times [2022-04-28 09:39:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:34,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971387723] [2022-04-28 09:39:34,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:34,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 2 times [2022-04-28 09:39:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:34,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114419885] [2022-04-28 09:39:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:34,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(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(9, 2); {149#true} is VALID [2022-04-28 09:39:34,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:39:34,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 09:39:34,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:34,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(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(9, 2); {149#true} is VALID [2022-04-28 09:39:34,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:39:34,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 09:39:34,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-28 09:39:34,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {154#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:39:34,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {155#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-28 09:39:34,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-28 09:39:34,226 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-28 09:39:34,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-28 09:39:34,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-28 09:39:34,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 09:39:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114419885] [2022-04-28 09:39:34,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114419885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041184352] [2022-04-28 09:39:34,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:39:34,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:34,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:34,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:39:34,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:39:34,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:39:34,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:34,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:39:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:34,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:34,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {149#true} is VALID [2022-04-28 09:39:34,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {149#true} is VALID [2022-04-28 09:39:34,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:39:34,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 09:39:34,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-28 09:39:34,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {175#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:39:34,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {179#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:39:34,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-28 09:39:34,505 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-28 09:39:34,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-28 09:39:34,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-28 09:39:34,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 09:39:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:34,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:34,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 09:39:34,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-28 09:39:34,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-28 09:39:34,630 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-28 09:39:34,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-28 09:39:34,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {207#(<= main_~i~0 main_~j~0)} is VALID [2022-04-28 09:39:34,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {211#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-28 09:39:34,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-28 09:39:34,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 09:39:34,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:39:34,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {149#true} is VALID [2022-04-28 09:39:34,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {149#true} is VALID [2022-04-28 09:39:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:34,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041184352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:34,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:34,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-28 09:39:34,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971387723] [2022-04-28 09:39:34,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971387723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:34,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:34,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:39:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826578215] [2022-04-28 09:39:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:39:34,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:34,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,655 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:39:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:39:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:39:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:39:34,658 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:34,742 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 09:39:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:39:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:39:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:39:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:39:34,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 09:39:34,778 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:39:34,781 INFO L225 Difference]: With dead ends: 19 [2022-04-28 09:39:34,781 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:39:34,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:39:34,788 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:34,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:39:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:39:34,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:34,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,800 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,800 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:34,801 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:39:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:39:34,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:34,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:34,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:39:34,803 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:39:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:34,805 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:39:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:39:34,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:34,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:34,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:34,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 09:39:34,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 09:39:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:34,814 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 09:39:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:34,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 09:39:34,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:39:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:39:34,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:34,829 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:34,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:35,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:35,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1978857264, now seen corresponding path program 3 times [2022-04-28 09:39:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307989140] [2022-04-28 09:39:35,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:35,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1978857264, now seen corresponding path program 4 times [2022-04-28 09:39:35,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:35,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764123843] [2022-04-28 09:39:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:35,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#(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(9, 2); {330#true} is VALID [2022-04-28 09:39:35,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 09:39:35,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-28 09:39:35,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:35,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(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(9, 2); {330#true} is VALID [2022-04-28 09:39:35,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 09:39:35,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-28 09:39:35,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-28 09:39:35,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {335#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:39:35,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {336#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-28 09:39:35,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {337#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-28 09:39:35,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-28 09:39:35,133 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-28 09:39:35,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-28 09:39:35,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-28 09:39:35,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-28 09:39:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:35,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764123843] [2022-04-28 09:39:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764123843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564427519] [2022-04-28 09:39:35,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:39:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:35,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:35,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:39:35,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:39:35,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:39:35,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:39:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:35,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2022-04-28 09:39:35,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {330#true} is VALID [2022-04-28 09:39:35,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 09:39:35,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-28 09:39:35,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-28 09:39:35,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {357#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:39:35,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {357#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {361#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:39:35,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {365#(and (<= main_~i~0 5) (<= 8 main_~j~0))} is VALID [2022-04-28 09:39:35,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(and (<= main_~i~0 5) (<= 8 main_~j~0))} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-28 09:39:35,344 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-28 09:39:35,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-28 09:39:35,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-28 09:39:35,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-28 09:39:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:35,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:35,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-28 09:39:35,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-28 09:39:35,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-28 09:39:35,457 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-28 09:39:35,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {393#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-28 09:39:35,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {393#(<= main_~i~0 main_~j~0)} is VALID [2022-04-28 09:39:35,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {337#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-28 09:39:35,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {336#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-28 09:39:35,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-28 09:39:35,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-28 09:39:35,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-28 09:39:35,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {330#true} is VALID [2022-04-28 09:39:35,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2022-04-28 09:39:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:35,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564427519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:35,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:35,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 09:39:35,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307989140] [2022-04-28 09:39:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307989140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:35,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:39:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352429902] [2022-04-28 09:39:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 09:39:35,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:35,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:39:35,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:39:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:39:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:39:35,477 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:39:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:35,549 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:39:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:39:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 09:39:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:39:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:39:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:39:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:39:35,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 09:39:35,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:35,570 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:39:35,570 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:39:35,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:39:35,571 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:35,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:39:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:39:35,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:35,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:35,577 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:35,577 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:35,578 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:39:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:39:35,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:35,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:35,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:39:35,579 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:39:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:35,580 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:39:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:39:35,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:35,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:35,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:35,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:39:35,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 09:39:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:35,582 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:39:35,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:39:35,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:39:35,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:39:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:39:35,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:35,595 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:35,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:39:35,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1180537966, now seen corresponding path program 5 times [2022-04-28 09:39:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:35,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079909432] [2022-04-28 09:39:35,809 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:35,809 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1180537966, now seen corresponding path program 6 times [2022-04-28 09:39:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:35,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284792280] [2022-04-28 09:39:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {535#(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(9, 2); {526#true} is VALID [2022-04-28 09:39:35,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-28 09:39:35,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-28 09:39:35,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:35,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(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(9, 2); {526#true} is VALID [2022-04-28 09:39:35,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-28 09:39:35,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-28 09:39:35,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-28 09:39:35,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {531#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:39:35,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {532#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-28 09:39:35,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {533#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-28 09:39:35,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {534#(<= main_~i~0 main_~j~0)} is VALID [2022-04-28 09:39:35,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-28 09:39:35,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-28 09:39:35,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-28 09:39:35,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-28 09:39:35,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-28 09:39:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:35,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284792280] [2022-04-28 09:39:35,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284792280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:35,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93232256] [2022-04-28 09:39:35,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:39:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:35,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:39:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:39:35,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:39:35,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:35,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:39:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:35,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:36,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-28 09:39:36,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {526#true} is VALID [2022-04-28 09:39:36,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-28 09:39:36,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-28 09:39:36,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-28 09:39:36,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {554#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-28 09:39:36,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {558#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:39:36,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {562#(and (<= main_~i~0 5) (<= 8 main_~j~0))} is VALID [2022-04-28 09:39:36,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(and (<= main_~i~0 5) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {566#(and (<= 7 main_~j~0) (<= main_~i~0 7))} is VALID [2022-04-28 09:39:36,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#(and (<= 7 main_~j~0) (<= main_~i~0 7))} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-28 09:39:36,123 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-28 09:39:36,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-28 09:39:36,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-28 09:39:36,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-28 09:39:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:36,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:36,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-28 09:39:36,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-28 09:39:36,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-28 09:39:36,244 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-28 09:39:36,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-28 09:39:36,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {534#(<= main_~i~0 main_~j~0)} is VALID [2022-04-28 09:39:36,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {533#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-28 09:39:36,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {532#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-28 09:39:36,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {603#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2022-04-28 09:39:36,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-28 09:39:36,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-28 09:39:36,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-28 09:39:36,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {526#true} is VALID [2022-04-28 09:39:36,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-28 09:39:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93232256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:36,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:36,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 09:39:36,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:36,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079909432] [2022-04-28 09:39:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079909432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:36,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:36,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:39:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267926359] [2022-04-28 09:39:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:36,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:39:36,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:36,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:36,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:39:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:36,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:39:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:39:36,261 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:36,358 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:39:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:39:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:39:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:39:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:39:36,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 09:39:36,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:36,395 INFO L225 Difference]: With dead ends: 21 [2022-04-28 09:39:36,396 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:39:36,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:39:36,398 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:36,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:39:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:39:36,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:36,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,408 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,408 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:36,409 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:39:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:39:36,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:36,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:36,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:39:36,412 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:39:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:36,413 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:39:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:39:36,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:36,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:36,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:36,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 09:39:36,415 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 09:39:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:36,415 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 09:39:36,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:39:36,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 09:39:36,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:39:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:39:36,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:36,429 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:36,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:36,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2092523792, now seen corresponding path program 7 times [2022-04-28 09:39:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1849852023] [2022-04-28 09:39:36,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:36,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2092523792, now seen corresponding path program 8 times [2022-04-28 09:39:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:36,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019850261] [2022-04-28 09:39:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:36,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {750#(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(9, 2); {738#true} is VALID [2022-04-28 09:39:36,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-28 09:39:36,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-28 09:39:36,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:36,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#(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(9, 2); {738#true} is VALID [2022-04-28 09:39:36,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-28 09:39:36,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-28 09:39:36,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-28 09:39:36,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {743#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:39:36,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {743#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {744#(and (<= main_~j~0 9) (<= 3 main_~i~0))} is VALID [2022-04-28 09:39:36,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {744#(and (<= main_~j~0 9) (<= 3 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {745#(and (<= main_~j~0 8) (<= 5 main_~i~0))} is VALID [2022-04-28 09:39:36,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {745#(and (<= main_~j~0 8) (<= 5 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {746#(and (<= main_~j~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 09:39:36,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(and (<= main_~j~0 7) (<= 7 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:36,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:36,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:39:36,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {749#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:39:36,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {749#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {739#false} is VALID [2022-04-28 09:39:36,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-28 09:39:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:36,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019850261] [2022-04-28 09:39:36,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019850261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:36,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838390159] [2022-04-28 09:39:36,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:39:36,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:36,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:36,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:39:36,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:39:36,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:39:36,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:36,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:39:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:36,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:37,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-28 09:39:37,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {738#true} is VALID [2022-04-28 09:39:37,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-28 09:39:37,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-28 09:39:37,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-28 09:39:37,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {769#(= main_~j~0 10)} is VALID [2022-04-28 09:39:37,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {769#(= main_~j~0 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {773#(= 10 (+ main_~j~0 1))} is VALID [2022-04-28 09:39:37,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= 10 (+ main_~j~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {777#(= (+ main_~j~0 2) 10)} is VALID [2022-04-28 09:39:37,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(= (+ main_~j~0 2) 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {781#(= 7 main_~j~0)} is VALID [2022-04-28 09:39:37,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= 7 main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:37,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:37,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:37,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:37,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {739#false} is VALID [2022-04-28 09:39:37,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-28 09:39:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:37,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:37,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-28 09:39:37,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {739#false} is VALID [2022-04-28 09:39:37,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:37,214 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:37,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:37,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= 7 main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 09:39:37,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(= (+ main_~j~0 2) 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {781#(= 7 main_~j~0)} is VALID [2022-04-28 09:39:37,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= 10 (+ main_~j~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {777#(= (+ main_~j~0 2) 10)} is VALID [2022-04-28 09:39:37,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {769#(= main_~j~0 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {773#(= 10 (+ main_~j~0 1))} is VALID [2022-04-28 09:39:37,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {769#(= main_~j~0 10)} is VALID [2022-04-28 09:39:37,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-28 09:39:37,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-28 09:39:37,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-28 09:39:37,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {738#true} is VALID [2022-04-28 09:39:37,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-28 09:39:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:37,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838390159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:37,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:37,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-28 09:39:37,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1849852023] [2022-04-28 09:39:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1849852023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:37,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:37,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:39:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205966098] [2022-04-28 09:39:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:37,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 09:39:37,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:37,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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:39:37,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:39:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:39:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:39:37,236 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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:39:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:37,432 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:39:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:39:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 09:39:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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:39:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-28 09:39:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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:39:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-28 09:39:37,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-28 09:39:37,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:37,454 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:39:37,454 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:39:37,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:39:37,455 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:37,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:39:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:39:37,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:37,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:37,456 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:37,456 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:37,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:37,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:37,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:37,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:37,457 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:37,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:37,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:37,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:37,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:37,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:39:37,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-28 09:39:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:37,458 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:39:37,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 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:39:37,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:39:37,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:37,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:37,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:39:37,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 09:39:37,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:37,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:39:37,774 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:37,775 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-28 09:39:37,775 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-28 09:39:37,775 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (let ((.cse0 (<= 7 main_~i~0))) (or (and (<= main_~j~0 6) (< 5 main_~j~0) .cse0) (and (<= main_~i~0 main_~j~0) (<= main_~j~0 7) .cse0) (and (<= main_~j~0 10) (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0)) (and (<= main_~j~0 8) (<= (+ main_~i~0 3) main_~j~0) (<= 5 main_~i~0)) (and (<= main_~j~0 9) (<= 3 main_~i~0) (<= (+ main_~i~0 6) main_~j~0)))) [2022-04-28 09:39:37,776 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0) (<= 7 main_~i~0)) [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:37,776 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:37,777 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:37,777 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:37,777 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:39:37,777 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:39:37,777 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:39:37,779 INFO L356 BasicCegarLoop]: Path program histogram: [8, 2] [2022-04-28 09:39:37,781 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:39:37,783 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:37,783 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:37,787 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:39:37,789 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:39:37,789 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:37,789 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:37,802 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:39:37,802 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:39:37,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:39:37 BoogieIcfgContainer [2022-04-28 09:39:37,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:39:37,811 INFO L158 Benchmark]: Toolchain (without parser) took 4852.26ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 131.0MB in the beginning and 149.1MB in the end (delta: -18.1MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2022-04-28 09:39:37,811 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:39:37,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.04ms. Allocated memory is still 179.3MB. Free memory was 130.8MB in the beginning and 155.2MB in the end (delta: -24.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-28 09:39:37,812 INFO L158 Benchmark]: Boogie Preprocessor took 40.96ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:39:37,812 INFO L158 Benchmark]: RCFGBuilder took 192.40ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 143.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:39:37,813 INFO L158 Benchmark]: TraceAbstraction took 4340.23ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 143.1MB in the beginning and 149.1MB in the end (delta: -6.0MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2022-04-28 09:39:37,814 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.13ms. Allocated memory is still 179.3MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.04ms. Allocated memory is still 179.3MB. Free memory was 130.8MB in the beginning and 155.2MB in the end (delta: -24.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.96ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 192.40ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 143.7MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4340.23ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 143.1MB in the beginning and 149.1MB in the end (delta: -6.0MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 57 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 49 PreInvPairs, 70 NumberOfFragments, 101 HoareAnnotationTreeSize, 49 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((j <= 6 && 5 < j) && 7 <= i) || ((i <= j && j <= 7) && 7 <= i)) || ((j <= 10 && 10 <= j) && -1 + i == 0)) || ((j <= 8 && i + 3 <= j) && 5 <= i)) || ((j <= 9 && 3 <= i) && i + 6 <= j) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:39:37,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...