/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:00:51,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:00:51,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:00:51,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:00:51,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:00:51,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:00:51,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:00:51,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:00:51,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:00:51,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:00:51,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:00:51,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:00:51,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:00:51,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:00:51,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:00:51,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:00:51,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:00:51,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:00:51,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:00:51,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:00:51,343 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:00:51,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:00:51,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:00:51,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:00:51,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:00:51,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:00:51,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:00:51,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:00:51,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:00:51,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:00:51,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:00:51,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:00:51,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:00:51,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:00:51,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:00:51,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:00:51,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:00:51,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:00:51,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:00:51,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:00:51,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:00:51,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:00:51,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:00:51,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:00:51,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:00:51,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:00:51,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:00:51,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:00:51,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:00:51,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:00:51,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:00:51,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:51,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:00:51,372 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:00:51,372 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-08 09:00:51,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:00:51,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:00:51,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:00:51,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:00:51,553 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:00:51,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-08 09:00:51,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16be6db2/0f4a9f8b895c47688b28006ffd1df220/FLAG3e265b4fc [2022-04-08 09:00:51,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:00:51,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-08 09:00:51,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16be6db2/0f4a9f8b895c47688b28006ffd1df220/FLAG3e265b4fc [2022-04-08 09:00:52,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16be6db2/0f4a9f8b895c47688b28006ffd1df220 [2022-04-08 09:00:52,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:00:52,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:00:52,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:52,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:00:52,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:00:52,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360b1199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52, skipping insertion in model container [2022-04-08 09:00:52,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:00:52,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:00:52,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-08 09:00:52,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:52,680 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:00:52,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-08 09:00:52,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:52,699 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:00:52,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52 WrapperNode [2022-04-08 09:00:52,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:52,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:00:52,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:00:52,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:00:52,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:00:52,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:00:52,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:00:52,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:00:52,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (1/1) ... [2022-04-08 09:00:52,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:52,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:52,764 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-08 09:00:52,774 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-08 09:00:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:00:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:00:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:00:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:00:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:00:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:00:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:00:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:00:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:00:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:00:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:00:52,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:00:52,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:00:52,935 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:00:52,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:00:52,939 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:00:52,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:52 BoogieIcfgContainer [2022-04-08 09:00:52,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:00:52,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:00:52,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:00:52,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:00:52,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:00:52" (1/3) ... [2022-04-08 09:00:52,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b053b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:52, skipping insertion in model container [2022-04-08 09:00:52,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:52" (2/3) ... [2022-04-08 09:00:52,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b053b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:52, skipping insertion in model container [2022-04-08 09:00:52,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:52" (3/3) ... [2022-04-08 09:00:52,945 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2022-04-08 09:00:52,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:00:52,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:00:52,974 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:00:52,979 INFO L340 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 [2022-04-08 09:00:52,979 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:00:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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-08 09:00:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:00:52,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:52,994 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:52,994 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 1 times [2022-04-08 09:00:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:53,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740365555] [2022-04-08 09:00:53,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:00:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 2 times [2022-04-08 09:00:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:53,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836353142] [2022-04-08 09:00:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:53,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-08 09:00:53,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:00:53,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-08 09:00:53,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:53,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-08 09:00:53,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:00:53,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-08 09:00:53,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-08 09:00:53,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:53,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:53,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:53,205 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:53,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:53,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:00:53,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:00:53,207 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-08 09:00:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:53,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836353142] [2022-04-08 09:00:53,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836353142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:53,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:53,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:53,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:53,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740365555] [2022-04-08 09:00:53,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740365555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:53,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:53,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530735875] [2022-04-08 09:00:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:00:53,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:53,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:53,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:53,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:00:53,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:00:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:00:53,245 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:53,474 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 09:00:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:00:53,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:00:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 09:00:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 09:00:53,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-08 09:00:53,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:53,536 INFO L225 Difference]: With dead ends: 39 [2022-04-08 09:00:53,536 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:00:53,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:00:53,543 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:53,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:00:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:00:53,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:53,569 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-08 09:00:53,569 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-08 09:00:53,569 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-08 09:00:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:53,572 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:00:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:00:53,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:53,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:53,573 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-08 09:00:53,573 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-08 09:00:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:53,575 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:00:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:00:53,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:53,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:53,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:53,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:53,576 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-08 09:00:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:00:53,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-08 09:00:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:53,584 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:00:53,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:53,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:00:53,599 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-08 09:00:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:00:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:00:53,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:53,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:53,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:00:53,608 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 1 times [2022-04-08 09:00:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:53,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941264693] [2022-04-08 09:00:53,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:53,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 2 times [2022-04-08 09:00:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:53,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260504007] [2022-04-08 09:00:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:53,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#(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(10, 2); {180#true} is VALID [2022-04-08 09:00:53,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-08 09:00:53,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-08 09:00:53,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:53,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(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(10, 2); {180#true} is VALID [2022-04-08 09:00:53,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-08 09:00:53,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-08 09:00:53,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret3 := main(); {180#true} is VALID [2022-04-08 09:00:53,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {185#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:53,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:53,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {187#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-08 09:00:53,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {188#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:53,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {189#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:53,849 INFO L272 TraceCheckUtils]: 10: Hoare triple {189#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:53,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:53,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-08 09:00:53,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-08 09:00:53,850 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-08 09:00:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:53,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260504007] [2022-04-08 09:00:53,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260504007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:53,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045666544] [2022-04-08 09:00:53,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:53,852 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-08 09:00:53,860 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-08 09:00:53,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:53,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:53,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:00:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:53,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:54,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-08 09:00:54,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(10, 2); {180#true} is VALID [2022-04-08 09:00:54,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-08 09:00:54,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-08 09:00:54,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret3 := main(); {180#true} is VALID [2022-04-08 09:00:54,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {185#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:54,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:54,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {217#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:54,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {221#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:54,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} assume !(~i~0 <= ~n~0); {225#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:54,243 INFO L272 TraceCheckUtils]: 10: Hoare triple {225#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:54,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:54,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-08 09:00:54,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-08 09:00:54,244 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-08 09:00:54,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:54,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-08 09:00:54,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-08 09:00:54,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:54,552 INFO L272 TraceCheckUtils]: 10: Hoare triple {249#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:54,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {253#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {249#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:54,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {253#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:54,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {257#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:54,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {261#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:54,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {265#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:54,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret3 := main(); {180#true} is VALID [2022-04-08 09:00:54,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-08 09:00:54,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-08 09:00:54,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(10, 2); {180#true} is VALID [2022-04-08 09:00:54,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-08 09:00:54,560 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-08 09:00:54,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045666544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:54,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:54,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 09:00:54,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941264693] [2022-04-08 09:00:54,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941264693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:54,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:54,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:00:54,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581399160] [2022-04-08 09:00:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:54,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,575 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-08 09:00:54,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:00:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:00:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:00:54,576 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:54,826 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:00:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:00:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-08 09:00:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-08 09:00:54,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-08 09:00:54,849 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-08 09:00:54,850 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:00:54,850 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:00:54,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:00:54,851 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:54,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:00:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:00:54,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:54,859 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-08 09:00:54,859 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-08 09:00:54,859 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-08 09:00:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:54,860 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:00:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:00:54,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:54,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:54,861 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-08 09:00:54,861 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-08 09:00:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:54,862 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:00:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:00:54,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:54,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:54,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:54,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:54,863 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-08 09:00:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:00:54,864 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-08 09:00:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:54,864 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:00:54,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-08 09:00:54,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:00:54,884 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-08 09:00:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:00:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:00:54,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:54,885 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:54,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:00:55,107 WARN L460 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-08 09:00:55,111 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1799219726, now seen corresponding path program 3 times [2022-04-08 09:00:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:55,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87502369] [2022-04-08 09:00:55,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:55,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1799219726, now seen corresponding path program 4 times [2022-04-08 09:00:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715824815] [2022-04-08 09:00:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:55,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:55,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#(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(10, 2); {412#true} is VALID [2022-04-08 09:00:55,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume true; {412#true} is VALID [2022-04-08 09:00:55,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {412#true} {412#true} #46#return; {412#true} is VALID [2022-04-08 09:00:55,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {412#true} call ULTIMATE.init(); {426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:55,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#(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(10, 2); {412#true} is VALID [2022-04-08 09:00:55,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume true; {412#true} is VALID [2022-04-08 09:00:55,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {412#true} {412#true} #46#return; {412#true} is VALID [2022-04-08 09:00:55,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {412#true} call #t~ret3 := main(); {412#true} is VALID [2022-04-08 09:00:55,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {417#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:55,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {418#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:55,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {419#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:55,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {420#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:55,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {421#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:55,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {422#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:55,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {423#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:55,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {423#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {424#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:55,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {425#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:55,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {425#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {413#false} is VALID [2022-04-08 09:00:55,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-04-08 09:00:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715824815] [2022-04-08 09:00:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715824815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175466976] [2022-04-08 09:00:55,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:55,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:55,289 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-08 09:00:55,290 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-08 09:00:55,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:55,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:55,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 09:00:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:55,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {412#true} call ULTIMATE.init(); {412#true} is VALID [2022-04-08 09:00:55,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#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(10, 2); {412#true} is VALID [2022-04-08 09:00:55,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume true; {412#true} is VALID [2022-04-08 09:00:55,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {412#true} {412#true} #46#return; {412#true} is VALID [2022-04-08 09:00:55,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {412#true} call #t~ret3 := main(); {412#true} is VALID [2022-04-08 09:00:55,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {417#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:55,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {418#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:55,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {419#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:55,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {454#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:55,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {458#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-08 09:00:55,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {462#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:55,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} assume !(~i~0 <= ~n~0); {466#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:00:55,812 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:55,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:55,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {413#false} is VALID [2022-04-08 09:00:55,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-04-08 09:00:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:55,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:56,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {413#false} assume !false; {413#false} is VALID [2022-04-08 09:00:56,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {413#false} is VALID [2022-04-08 09:00:56,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:56,170 INFO L272 TraceCheckUtils]: 12: Hoare triple {490#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:56,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {494#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {490#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:56,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {494#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:56,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {498#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:56,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {502#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:56,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {506#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:56,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) 2) (<= 3 (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {510#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:56,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {514#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) 2) (<= 3 (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:56,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {412#true} call #t~ret3 := main(); {412#true} is VALID [2022-04-08 09:00:56,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {412#true} {412#true} #46#return; {412#true} is VALID [2022-04-08 09:00:56,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume true; {412#true} is VALID [2022-04-08 09:00:56,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#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(10, 2); {412#true} is VALID [2022-04-08 09:00:56,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {412#true} call ULTIMATE.init(); {412#true} is VALID [2022-04-08 09:00:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:56,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175466976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:56,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-08 09:00:56,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:56,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87502369] [2022-04-08 09:00:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87502369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:56,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:56,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:00:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565533859] [2022-04-08 09:00:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:56,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:56,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:00:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:00:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:00:56,190 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:56,474 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:00:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:00:56,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 09:00:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 09:00:56,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-08 09:00:56,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:56,495 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:00:56,495 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 09:00:56,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 09:00:56,496 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:56,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 09:00:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 09:00:56,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:56,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:56,506 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:56,506 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:56,507 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:00:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:00:56,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:56,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:56,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:00:56,508 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 09:00:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:56,508 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:00:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:00:56,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:56,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:56,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:56,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 09:00:56,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-08 09:00:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:56,510 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 09:00:56,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-08 09:00:56,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 09:00:56,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:00:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:00:56,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:56,526 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:56,553 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-08 09:00:56,742 WARN L460 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-08 09:00:56,742 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1341755824, now seen corresponding path program 5 times [2022-04-08 09:00:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:56,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556728234] [2022-04-08 09:00:56,745 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:56,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1341755824, now seen corresponding path program 6 times [2022-04-08 09:00:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838309511] [2022-04-08 09:00:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:56,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(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(10, 2); {677#true} is VALID [2022-04-08 09:00:56,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-08 09:00:56,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {677#true} {677#true} #46#return; {677#true} is VALID [2022-04-08 09:00:56,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:56,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#(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(10, 2); {677#true} is VALID [2022-04-08 09:00:56,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-08 09:00:56,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #46#return; {677#true} is VALID [2022-04-08 09:00:56,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret3 := main(); {677#true} is VALID [2022-04-08 09:00:56,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {682#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:56,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {682#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {683#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:56,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {684#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:56,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {684#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {685#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:56,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {686#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:56,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {685#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:56,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {687#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:56,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {688#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:56,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {689#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:56,909 INFO L272 TraceCheckUtils]: 14: Hoare triple {689#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {690#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:56,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {690#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {691#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:56,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {691#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {678#false} is VALID [2022-04-08 09:00:56,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {678#false} assume !false; {678#false} is VALID [2022-04-08 09:00:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:00:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:56,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838309511] [2022-04-08 09:00:56,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838309511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:56,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122679758] [2022-04-08 09:00:56,910 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:56,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:56,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:56,911 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-08 09:00:56,951 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-08 09:00:56,953 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:00:56,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:56,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:00:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:56,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:57,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2022-04-08 09:00:57,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {677#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(10, 2); {677#true} is VALID [2022-04-08 09:00:57,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-08 09:00:57,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #46#return; {677#true} is VALID [2022-04-08 09:00:57,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret3 := main(); {677#true} is VALID [2022-04-08 09:00:57,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {682#(= main_~sn~0 0)} is VALID [2022-04-08 09:00:57,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {682#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {683#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:57,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {684#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:57,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {684#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {720#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:57,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {724#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-08 09:00:57,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {724#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {728#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:00:57,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {732#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:00:57,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {732#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {736#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-08 09:00:57,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {740#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-08 09:00:57,370 INFO L272 TraceCheckUtils]: 14: Hoare triple {740#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:57,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:57,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {678#false} is VALID [2022-04-08 09:00:57,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {678#false} assume !false; {678#false} is VALID [2022-04-08 09:00:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:57,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:57,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {678#false} assume !false; {678#false} is VALID [2022-04-08 09:00:57,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {678#false} is VALID [2022-04-08 09:00:57,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:57,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {764#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:57,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {764#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:57,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {768#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:57,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:57,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {780#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {776#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:57,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {780#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:57,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {784#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:57,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {788#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:57,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {792#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-08 09:00:57,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {796#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} is VALID [2022-04-08 09:00:57,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret3 := main(); {677#true} is VALID [2022-04-08 09:00:57,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #46#return; {677#true} is VALID [2022-04-08 09:00:57,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2022-04-08 09:00:57,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {677#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(10, 2); {677#true} is VALID [2022-04-08 09:00:57,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2022-04-08 09:00:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:57,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122679758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:57,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:57,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-04-08 09:00:57,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:57,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556728234] [2022-04-08 09:00:57,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556728234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:57,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:57,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 09:00:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983407164] [2022-04-08 09:00:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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 18 [2022-04-08 09:00:57,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:57,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-08 09:00:57,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:57,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 09:00:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 09:00:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:00:57,788 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-08 09:00:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:58,039 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:00:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:00:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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 18 [2022-04-08 09:00:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-08 09:00:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2022-04-08 09:00:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-08 09:00:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2022-04-08 09:00:58,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 16 transitions. [2022-04-08 09:00:58,055 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-08 09:00:58,055 INFO L225 Difference]: With dead ends: 19 [2022-04-08 09:00:58,055 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:00:58,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 09:00:58,056 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:58,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:00:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:00:58,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:58,057 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-08 09:00:58,057 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-08 09:00:58,057 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-08 09:00:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:58,058 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:00:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:58,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:58,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:58,058 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-08 09:00:58,058 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-08 09:00:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:58,058 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:00:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:58,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:58,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:58,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:58,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:58,060 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-08 09:00:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:00:58,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-08 09:00:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:58,061 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:00:58,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-08 09:00:58,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:00:58,061 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-08 09:00:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:58,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:58,063 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:00:58,081 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-08 09:00:58,263 WARN L460 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-08 09:00:58,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:00:58,374 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:00:58,374 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:00:58,374 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:00:58,374 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 29) the Hoare annotation is: true [2022-04-08 09:00:58,374 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 29) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (= main_~sn~0 0) [2022-04-08 09:00:58,375 INFO L878 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= main_~sn~0 .cse0) (<= .cse0 main_~sn~0))) [2022-04-08 09:00:58,375 INFO L878 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (or (and (= main_~sn~0 0) (= main_~i~0 1)) (let ((.cse1 (+ 2 main_~sn~0)) (.cse0 (* main_~i~0 2))) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= .cse0 .cse1) (<= .cse1 .cse0)))) [2022-04-08 09:00:58,375 INFO L878 garLoopResultBuilder]: At program point L25-4(lines 25 27) the Hoare annotation is: (or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0)) [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 29) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L878 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-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:00:58,375 INFO L878 garLoopResultBuilder]: At program point L17(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:00:58,376 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:00:58,376 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-04-08 09:00:58,376 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:00:58,376 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:00:58,376 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:00:58,378 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2] [2022-04-08 09:00:58,379 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:00:58,381 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:58,381 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:58,382 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:00:58,388 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:00:58,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:00:58 BoogieIcfgContainer [2022-04-08 09:00:58,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:00:58,395 INFO L158 Benchmark]: Toolchain (without parser) took 5986.75ms. Allocated memory was 181.4MB in the beginning and 262.1MB in the end (delta: 80.7MB). Free memory was 131.6MB in the beginning and 231.7MB in the end (delta: -100.1MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-04-08 09:00:58,396 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 147.9MB in the beginning and 147.9MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:00:58,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.95ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 131.4MB in the beginning and 195.3MB in the end (delta: -63.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-08 09:00:58,396 INFO L158 Benchmark]: Boogie Preprocessor took 21.30ms. Allocated memory is still 218.1MB. Free memory was 195.3MB in the beginning and 193.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:00:58,396 INFO L158 Benchmark]: RCFGBuilder took 218.29ms. Allocated memory is still 218.1MB. Free memory was 193.9MB in the beginning and 182.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:00:58,397 INFO L158 Benchmark]: TraceAbstraction took 5453.28ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 182.4MB in the beginning and 231.7MB in the end (delta: -49.3MB). Peak memory consumption was 109.7MB. Max. memory is 8.0GB. [2022-04-08 09:00:58,398 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.11ms. Allocated memory is still 181.4MB. Free memory was 147.9MB in the beginning and 147.9MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.95ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 131.4MB in the beginning and 195.3MB in the end (delta: -63.9MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.30ms. Allocated memory is still 218.1MB. Free memory was 195.3MB in the beginning and 193.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 218.29ms. Allocated memory is still 218.1MB. Free memory was 193.9MB in the beginning and 182.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5453.28ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 182.4MB in the beginning and 231.7MB in the end (delta: -49.3MB). Peak memory consumption was 109.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 42 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 20 LocationsWithAnnotation, 44 PreInvPairs, 65 NumberOfFragments, 107 HoareAnnotationTreeSize, 44 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 91 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (sn == 0 && i == 1) || ((sn < n * 2 + 1 && i * 2 <= 2 + sn) && 2 + sn <= i * 2) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: 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-08 09:00:58,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...