/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/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:41:27,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:41:27,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:41:27,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:41:27,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:41:27,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:41:27,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:41:27,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:41:27,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:41:27,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:41:27,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:41:27,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:41:27,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:41:27,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:41:27,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:41:27,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:41:27,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:41:27,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:41:27,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:41:27,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:41:27,247 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:41:27,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:41:27,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:41:27,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:41:27,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:41:27,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:41:27,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:41:27,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:41:27,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:41:27,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:41:27,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:41:27,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:41:27,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:41:27,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:41:27,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:41:27,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:41:27,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:41:27,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:41:27,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:41:27,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:41:27,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:41:27,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:41:27,268 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:41:27,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:41:27,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:41:27,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:41:27,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:41:27,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:41:27,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:41:27,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:41:27,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:41:27,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:27,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:41:27,285 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:41:27,285 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:41:27,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:41:27,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:41:27,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:41:27,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:41:27,515 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:41:27,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-28 09:41:27,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178dde293/6cbd8cfa8b924ba5ae41f684930688c3/FLAG06ca11066 [2022-04-28 09:41:27,997 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:41:27,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-28 09:41:28,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178dde293/6cbd8cfa8b924ba5ae41f684930688c3/FLAG06ca11066 [2022-04-28 09:41:28,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178dde293/6cbd8cfa8b924ba5ae41f684930688c3 [2022-04-28 09:41:28,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:41:28,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:41:28,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:28,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:41:28,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:41:28,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5196f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28, skipping insertion in model container [2022-04-28 09:41:28,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:41:28,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:41:28,569 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/jm2006.i[895,908] [2022-04-28 09:41:28,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:28,585 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:41:28,595 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/jm2006.i[895,908] [2022-04-28 09:41:28,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:28,609 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:41:28,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28 WrapperNode [2022-04-28 09:41:28,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:28,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:41:28,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:41:28,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:41:28,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:41:28,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:41:28,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:41:28,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:41:28,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (1/1) ... [2022-04-28 09:41:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:28,663 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:41:28,669 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:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:41:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:41:28,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:41:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:41:28,791 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:41:28,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:41:28,957 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:41:28,962 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:41:28,963 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:41:28,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:28 BoogieIcfgContainer [2022-04-28 09:41:28,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:41:28,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:41:28,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:41:28,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:41:28,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:41:28" (1/3) ... [2022-04-28 09:41:28,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e73cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:28, skipping insertion in model container [2022-04-28 09:41:28,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:28" (2/3) ... [2022-04-28 09:41:28,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e73cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:28, skipping insertion in model container [2022-04-28 09:41:28,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:28" (3/3) ... [2022-04-28 09:41:28,971 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.i [2022-04-28 09:41:28,981 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:41:28,981 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:41:29,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:41:29,023 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@606f160d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@545d9e9c [2022-04-28 09:41:29,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:41:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:41:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:41:29,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:29,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:29,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 1 times [2022-04-28 09:41:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2135513320] [2022-04-28 09:41:29,057 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 2 times [2022-04-28 09:41:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:29,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702380150] [2022-04-28 09:41:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:29,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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); {24#true} is VALID [2022-04-28 09:41:29,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 09:41:29,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-28 09:41:29,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:29,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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); {24#true} is VALID [2022-04-28 09:41:29,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 09:41:29,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-28 09:41:29,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 09:41:29,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-28 09:41:29,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:29,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:29,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume ~i~0 == ~j~0; {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:29,505 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:29,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:29,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 09:41:29,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 09:41:29,507 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:41:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:29,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702380150] [2022-04-28 09:41:29,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702380150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:29,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:29,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:29,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2135513320] [2022-04-28 09:41:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2135513320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:29,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:29,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435236137] [2022-04-28 09:41:29,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:29,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:29,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:29,536 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:41:29,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:41:29,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:41:29,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:41:29,564 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:30,067 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 09:41:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:41:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 09:41:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 09:41:30,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-28 09:41:30,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:30,172 INFO L225 Difference]: With dead ends: 47 [2022-04-28 09:41:30,172 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:41:30,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:41:30,178 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:30,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:41:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:41:30,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:30,206 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:41:30,206 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:41:30,207 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:41:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:30,209 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:30,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:30,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:30,210 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:41:30,210 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:41:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:30,212 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:30,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:30,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:30,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:30,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:30,213 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:41:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:41:30,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 09:41:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:30,215 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:41:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:41:30,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:41:30,232 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:41:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:41:30,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:30,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:30,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:41:30,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 1 times [2022-04-28 09:41:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:30,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775707060] [2022-04-28 09:41:30,248 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:30,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 2 times [2022-04-28 09:41:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:30,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326155863] [2022-04-28 09:41:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:30,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(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); {203#true} is VALID [2022-04-28 09:41:30,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 09:41:30,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 09:41:30,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:30,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#(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); {203#true} is VALID [2022-04-28 09:41:30,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 09:41:30,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 09:41:30,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-28 09:41:30,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {203#true} is VALID [2022-04-28 09:41:30,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:30,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {209#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} is VALID [2022-04-28 09:41:30,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} assume !(0 != ~x~0); {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:30,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:30,474 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:30,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:30,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-28 09:41:30,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 09:41:30,476 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:41:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:30,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326155863] [2022-04-28 09:41:30,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326155863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:30,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414089719] [2022-04-28 09:41:30,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:30,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:30,479 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:41:30,511 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:41:30,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:30,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:30,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:41:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:30,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:30,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-28 09:41:30,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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); {203#true} is VALID [2022-04-28 09:41:30,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 09:41:30,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 09:41:30,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-28 09:41:30,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {203#true} is VALID [2022-04-28 09:41:30,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:30,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {239#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:30,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {243#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} is VALID [2022-04-28 09:41:30,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:30,877 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:30,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:30,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2022-04-28 09:41:30,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 09:41:30,882 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:41:30,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:31,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 09:41:31,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2022-04-28 09:41:31,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:31,113 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:31,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:31,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {273#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-28 09:41:31,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {277#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:31,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {281#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-28 09:41:31,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {203#true} is VALID [2022-04-28 09:41:31,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-28 09:41:31,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-28 09:41:31,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 09:41:31,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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); {203#true} is VALID [2022-04-28 09:41:31,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-28 09:41:31,118 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:41:31,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414089719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:31,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:31,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 09:41:31,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775707060] [2022-04-28 09:41:31,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775707060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:31,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:31,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:41:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566949769] [2022-04-28 09:41:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:31,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:31,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,133 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:41:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:41:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:41:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:41:31,135 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:31,437 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:41:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:41:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-28 09:41:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-28 09:41:31,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-28 09:41:31,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:31,465 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:41:31,466 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:41:31,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:41:31,468 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:31,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 42 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:41:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:41:31,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:31,484 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:41:31,485 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:41:31,485 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:41:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:31,487 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:41:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:31,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:31,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:31,495 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:41:31,495 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:41:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:31,496 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:41:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:31,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:31,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:31,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:31,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:31,497 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:41:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 09:41:31,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 09:41:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:31,498 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 09:41:31,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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:41:31,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 09:41:31,514 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:41:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:41:31,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:31,515 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:31,541 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:41:31,730 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:41:31,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash -757985953, now seen corresponding path program 3 times [2022-04-28 09:41:31,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:31,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773265286] [2022-04-28 09:41:31,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:31,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -757985953, now seen corresponding path program 4 times [2022-04-28 09:41:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:31,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144239050] [2022-04-28 09:41:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:31,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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); {425#true} is VALID [2022-04-28 09:41:31,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-28 09:41:31,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-28 09:41:31,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:31,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(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); {425#true} is VALID [2022-04-28 09:41:31,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-28 09:41:31,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-28 09:41:31,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-28 09:41:31,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {425#true} is VALID [2022-04-28 09:41:31,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:31,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:31,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {432#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-28 09:41:31,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {432#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} assume !(0 != ~x~0); {433#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:31,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:31,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:31,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {436#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:31,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {426#false} is VALID [2022-04-28 09:41:31,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-28 09:41:31,951 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:41:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144239050] [2022-04-28 09:41:31,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144239050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388120546] [2022-04-28 09:41:31,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:31,952 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:41:31,963 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:41:31,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:31,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:31,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:41:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:32,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:32,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-28 09:41:32,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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); {425#true} is VALID [2022-04-28 09:41:32,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-28 09:41:32,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-28 09:41:32,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-28 09:41:32,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {425#true} is VALID [2022-04-28 09:41:32,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:32,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:32,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {465#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:32,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} assume !(0 != ~x~0); {469#(and (= (+ (- 2) main_~i~0) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:32,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {469#(and (= (+ (- 2) main_~i~0) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:32,242 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:32,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:32,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-28 09:41:32,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-28 09:41:32,243 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:41:32,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:32,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-28 09:41:32,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-28 09:41:32,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:32,476 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:32,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {499#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-28 09:41:32,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {503#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:32,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {511#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {507#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-28 09:41:32,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {511#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} is VALID [2022-04-28 09:41:32,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {425#true} is VALID [2022-04-28 09:41:32,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-28 09:41:32,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-28 09:41:32,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-28 09:41:32,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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); {425#true} is VALID [2022-04-28 09:41:32,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-28 09:41:32,480 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:41:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388120546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:32,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:32,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 09:41:32,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:32,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773265286] [2022-04-28 09:41:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773265286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:32,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:32,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:41:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970123538] [2022-04-28 09:41:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:32,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:32,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,498 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:41:32,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:41:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:41:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:41:32,499 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:32,771 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:41:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:41:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-28 09:41:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-28 09:41:32,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-04-28 09:41:32,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:32,799 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:41:32,800 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:41:32,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:41:32,801 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:32,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:41:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:41:32,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:32,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,813 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,814 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:32,820 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:41:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:32,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:32,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:32,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:41:32,821 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:41:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:32,822 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:41:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:32,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:32,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:32,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:32,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:41:32,823 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 09:41:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:32,824 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:41:32,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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:41:32,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:41:32,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:41:32,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:32,844 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:32,867 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:41:33,061 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:41:33,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash -497670085, now seen corresponding path program 5 times [2022-04-28 09:41:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566722531] [2022-04-28 09:41:33,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:33,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash -497670085, now seen corresponding path program 6 times [2022-04-28 09:41:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:33,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433855560] [2022-04-28 09:41:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(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); {663#true} is VALID [2022-04-28 09:41:33,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:41:33,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-28 09:41:33,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(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); {663#true} is VALID [2022-04-28 09:41:33,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:41:33,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-28 09:41:33,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-28 09:41:33,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {663#true} is VALID [2022-04-28 09:41:33,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:33,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:33,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {670#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-28 09:41:33,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {671#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-28 09:41:33,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {671#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} assume !(0 != ~x~0); {672#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:33,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {672#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:33,253 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:33,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {675#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:33,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:41:33,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:41:33,255 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:41:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:33,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433855560] [2022-04-28 09:41:33,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433855560] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:33,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838624049] [2022-04-28 09:41:33,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:41:33,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:33,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:33,256 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:41:33,285 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:41:33,302 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:41:33,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:33,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 09:41:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:33,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-28 09:41:33,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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); {663#true} is VALID [2022-04-28 09:41:33,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:41:33,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-28 09:41:33,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-28 09:41:33,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {663#true} is VALID [2022-04-28 09:41:33,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:33,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:33,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {704#(and (<= main_~j~0 (+ main_~y~0 2)) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:33,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(and (<= main_~j~0 (+ main_~y~0 2)) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {708#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-28 09:41:33,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {708#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} assume !(0 != ~x~0); {712#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:41:33,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {712#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:33,568 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:33,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:33,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:41:33,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:41:33,580 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:41:33,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:33,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:41:33,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:41:33,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:33,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:33,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:33,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {746#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {742#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-28 09:41:33,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {746#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:33,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {754#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 2) (< 1 main_~y~0)) (not (= (+ (- 1) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {750#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} is VALID [2022-04-28 09:41:33,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {758#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 2) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {754#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 2) (< 1 main_~y~0)) (not (= (+ (- 1) main_~x~0) 1)))} is VALID [2022-04-28 09:41:33,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {758#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 2) main_~x~0) 1)))} is VALID [2022-04-28 09:41:33,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {663#true} is VALID [2022-04-28 09:41:33,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-28 09:41:33,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-28 09:41:33,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:41:33,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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); {663#true} is VALID [2022-04-28 09:41:33,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-28 09:41:33,858 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:41:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838624049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:33,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:33,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-28 09:41:33,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566722531] [2022-04-28 09:41:33,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566722531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:33,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:33,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:41:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353299015] [2022-04-28 09:41:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:41:33,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:33,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,883 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:41:33,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:41:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:41:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:41:33,885 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,129 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:41:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:41:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:41:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-28 09:41:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-28 09:41:34,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 16 transitions. [2022-04-28 09:41:34,146 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:41:34,146 INFO L225 Difference]: With dead ends: 17 [2022-04-28 09:41:34,146 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:41:34,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:41:34,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:34,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:41:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:41:34,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:34,149 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:41:34,149 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:41:34,149 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:41:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,149 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,150 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:41:34,150 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:41:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,150 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:34,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:34,151 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:41:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:41:34,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 09:41:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:34,151 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:41:34,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:41:34,151 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:41:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:34,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:41:34,178 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:41:34,363 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:41:34,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:41:34,532 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:34,533 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-28 09:41:34,533 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 34) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-28 09:41:34,533 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 09:41:34,533 INFO L895 garLoopResultBuilder]: At program point L31-3(lines 24 39) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 1))) (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0) (< 0 .cse0)) (let ((.cse2 (not (<= .cse0 0))) (.cse1 (+ main_~i~0 main_~y~0)) (.cse4 (+ main_~j~0 main_~x~0)) (.cse3 (<= main_~y~0 0))) (and (or (<= main_~j~0 .cse1) .cse2) (or .cse3 (<= .cse1 main_~j~0)) (or (<= .cse4 .cse1) .cse2) (or (<= .cse1 .cse4) .cse3))))) [2022-04-28 09:41:34,533 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 39) the Hoare annotation is: true [2022-04-28 09:41:34,533 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 39) the Hoare annotation is: true [2022-04-28 09:41:34,533 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point L35(lines 35 37) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 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:41:34,534 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:41:34,534 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:34,534 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:41:34,534 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:41:34,534 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:41:34,534 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:41:34,537 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2] [2022-04-28 09:41:34,538 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:41:34,541 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:34,541 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:34,543 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:41:34,545 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:41:34,545 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:34,545 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:34,546 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:41:34,553 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:41:34,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:41:34 BoogieIcfgContainer [2022-04-28 09:41:34,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:41:34,562 INFO L158 Benchmark]: Toolchain (without parser) took 6147.47ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 141.5MB in the beginning and 135.1MB in the end (delta: 6.4MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. [2022-04-28 09:41:34,562 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:41:34,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.31ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 167.3MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:34,562 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 165.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:41:34,563 INFO L158 Benchmark]: RCFGBuilder took 329.48ms. Allocated memory is still 191.9MB. Free memory was 165.8MB in the beginning and 155.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:34,563 INFO L158 Benchmark]: TraceAbstraction took 5594.99ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 154.3MB in the beginning and 135.1MB in the end (delta: 19.2MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2022-04-28 09:41:34,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.31ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 167.3MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 165.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 329.48ms. Allocated memory is still 191.9MB. Free memory was 165.8MB in the beginning and 155.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5594.99ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 154.3MB in the beginning and 135.1MB in the end (delta: 19.2MB). Peak memory consumption was 59.3MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 49 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 45 PreInvPairs, 74 NumberOfFragments, 133 HoareAnnotationTreeSize, 45 FomulaSimplifications, 70 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 215 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: 31]: Loop Invariant Derived loop invariant: i + y <= j + x && j + x <= i + y - 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: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:41:34,599 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...