/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/nla-digbench-scaling/sqrt1-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:40:41,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:40:41,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:40:41,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:40:41,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:40:41,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:40:41,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:40:41,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:40:41,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:40:41,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:40:41,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:40:41,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:40:41,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:40:41,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:40:41,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:40:41,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:40:41,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:40:41,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:40:41,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:40:41,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:40:41,133 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:40:41,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:40:41,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:40:41,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:40:41,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:40:41,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:40:41,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:40:41,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:40:41,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:40:41,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:40:41,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:40:41,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:40:41,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:40:41,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:40:41,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:40:41,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:40:41,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:40:41,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:40:41,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:40:41,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:40:41,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:40:41,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:40:41,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:40:41,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:40:41,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:40:41,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:40:41,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:40:41,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:40:41,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:40:41,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:40:41,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:40:41,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:40:41,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:40:41,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:40:41,161 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:40:41,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:40:41,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:40:41,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:40:41,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:40:41,348 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:40:41,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-28 14:40:41,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6613bd955/80c453342c9748548ed6d1a7495d2636/FLAGd97561ff4 [2022-04-28 14:40:41,743 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:40:41,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-28 14:40:41,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6613bd955/80c453342c9748548ed6d1a7495d2636/FLAGd97561ff4 [2022-04-28 14:40:41,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6613bd955/80c453342c9748548ed6d1a7495d2636 [2022-04-28 14:40:41,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:40:41,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:40:41,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:40:41,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:40:41,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:40:41,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:40:41" (1/1) ... [2022-04-28 14:40:41,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbf6ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:41, skipping insertion in model container [2022-04-28 14:40:41,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:40:41" (1/1) ... [2022-04-28 14:40:41,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:40:41,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:40:41,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-28 14:40:41,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:40:41,999 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:40:42,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-28 14:40:42,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:40:42,037 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:40:42,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42 WrapperNode [2022-04-28 14:40:42,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:40:42,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:40:42,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:40:42,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:40:42,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:40:42,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:40:42,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:40:42,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:40:42,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (1/1) ... [2022-04-28 14:40:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:40:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:42,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:40:42,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:40:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:40:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:40:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:40:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:40:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:40:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:40:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:40:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:40:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:40:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:40:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:40:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:40:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:40:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:40:42,203 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:40:42,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:40:42,329 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:40:42,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:40:42,356 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:40:42,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:40:42 BoogieIcfgContainer [2022-04-28 14:40:42,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:40:42,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:40:42,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:40:42,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:40:42,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:40:41" (1/3) ... [2022-04-28 14:40:42,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beca8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:40:42, skipping insertion in model container [2022-04-28 14:40:42,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:42" (2/3) ... [2022-04-28 14:40:42,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beca8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:40:42, skipping insertion in model container [2022-04-28 14:40:42,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:40:42" (3/3) ... [2022-04-28 14:40:42,363 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.c [2022-04-28 14:40:42,374 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:40:42,374 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:40:42,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:40:42,411 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59cfcf32, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@760f8f87 [2022-04-28 14:40:42,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:40:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:40:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:40:42,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:42,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:42,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 14:40:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557317325] [2022-04-28 14:40:42,438 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 14:40:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051301549] [2022-04-28 14:40:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:40:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:42,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:40:42,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:40:42,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:40:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:40:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:42,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:40:42,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:40:42,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:40:42,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:40:42,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:40:42,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:40:42,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:40:42,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:40:42,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 14:40:42,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-28 14:40:42,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {34#true} is VALID [2022-04-28 14:40:42,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:40:42,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:40:42,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:40:42,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:40:42,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 14:40:42,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 14:40:42,646 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-28 14:40:42,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 14:40:42,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 14:40:42,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 14:40:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:42,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051301549] [2022-04-28 14:40:42,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051301549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:42,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:42,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:40:42,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:42,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557317325] [2022-04-28 14:40:42,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557317325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:42,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:42,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:40:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407978035] [2022-04-28 14:40:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:42,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:42,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:42,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:42,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:40:42,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:40:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:40:42,720 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:42,891 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 14:40:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:40:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:40:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:40:42,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 14:40:43,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:43,018 INFO L225 Difference]: With dead ends: 53 [2022-04-28 14:40:43,018 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:40:43,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:40:43,025 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:43,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:40:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:40:43,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:43,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:43,052 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:43,053 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:43,056 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:40:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:43,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:43,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:43,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:40:43,057 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:40:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:43,061 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:40:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:43,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:43,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:43,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:43,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 14:40:43,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 14:40:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:43,066 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 14:40:43,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 14:40:43,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:40:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:43,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:43,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:40:43,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 14:40:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:43,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284142309] [2022-04-28 14:40:43,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 14:40:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698509413] [2022-04-28 14:40:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:40:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:43,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:40:43,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:43,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:40:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:40:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:43,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:40:43,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:40:43,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:43,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:40:43,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:40:43,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:40:43,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:43,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:40:43,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 14:40:43,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-28 14:40:43,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {256#true} is VALID [2022-04-28 14:40:43,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:40:43,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:40:43,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:43,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:40:43,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:40:43,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:40:43,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:43,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:40:43,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 14:40:43,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 14:40:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698509413] [2022-04-28 14:40:43,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698509413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:43,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:43,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284142309] [2022-04-28 14:40:43,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284142309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:43,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:43,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140423067] [2022-04-28 14:40:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:43,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:43,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:43,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:40:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:40:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:43,294 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:43,695 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:40:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:40:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:40:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:40:43,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 14:40:43,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:43,766 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:40:43,766 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:40:43,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:40:43,767 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:43,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:40:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:40:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 14:40:43,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:43,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:43,775 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:43,777 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:40:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:40:43,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:43,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:43,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:40:43,780 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:40:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:43,782 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:40:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:40:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:43,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:43,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:43,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 14:40:43,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 14:40:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:43,786 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 14:40:43,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:43,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 14:40:43,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 14:40:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:40:43,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:43,828 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:43,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:40:43,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 14:40:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518332462] [2022-04-28 14:40:43,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 14:40:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:43,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613479565] [2022-04-28 14:40:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:43,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144166841] [2022-04-28 14:40:43,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:43,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:43,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:43,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:40:43,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:43,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:43,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:40:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:43,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:44,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 14:40:44,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-28 14:40:44,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:44,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 14:40:44,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 14:40:44,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-28 14:40:44,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {507#true} is VALID [2022-04-28 14:40:44,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:40:44,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:40:44,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:44,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 14:40:44,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-28 14:40:44,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:40:44,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:40:44,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:44,097 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,098 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:44,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:44,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 14:40:44,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 14:40:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:44,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:40:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613479565] [2022-04-28 14:40:44,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144166841] [2022-04-28 14:40:44,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144166841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:44,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:44,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:44,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518332462] [2022-04-28 14:40:44,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518332462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:44,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:44,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281245704] [2022-04-28 14:40:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:40:44,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:44,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:44,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:40:44,117 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:44,246 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:40:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:40:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:44,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:40:44,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:44,296 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:40:44,296 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 14:40:44,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:44,301 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:44,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 14:40:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 14:40:44,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:44,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:44,330 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:44,331 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:44,335 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:40:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:40:44,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:44,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:44,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:40:44,336 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:40:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:44,341 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:40:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:40:44,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:44,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:44,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:44,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 14:40:44,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 14:40:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:44,344 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 14:40:44,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:44,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 14:40:44,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 14:40:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:40:44,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:44,389 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:44,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:44,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:44,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 14:40:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884476830] [2022-04-28 14:40:44,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 14:40:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923477347] [2022-04-28 14:40:44,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:44,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:44,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400746588] [2022-04-28 14:40:44,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:44,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:44,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:44,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:44,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:40:44,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:44,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:44,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:40:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:44,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:44,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 14:40:44,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#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(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-28 14:40:44,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:44,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 14:40:44,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 14:40:44,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-28 14:40:44,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:44,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:44,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:44,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:44,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 14:40:44,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,789 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:44,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:44,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:44,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:44,791 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,791 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:44,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:44,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:44,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:44,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:44,793 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:44,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:44,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 14:40:44,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 14:40:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:40:44,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:40:44,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:44,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923477347] [2022-04-28 14:40:44,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:44,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400746588] [2022-04-28 14:40:44,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400746588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:44,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:44,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:44,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:44,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884476830] [2022-04-28 14:40:44,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884476830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:44,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:44,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301699872] [2022-04-28 14:40:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:40:44,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:44,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:44,811 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-28 14:40:44,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:40:44,812 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:44,960 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 14:40:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:40:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:44,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:40:45,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:45,003 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:40:45,003 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:40:45,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:45,005 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:45,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:40:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:40:45,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:45,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:45,026 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:45,027 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:45,030 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:40:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:45,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:45,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:45,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:40:45,033 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:40:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:45,037 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:40:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:45,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:45,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:45,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:45,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 14:40:45,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 14:40:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:45,041 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 14:40:45,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:45,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 14:40:45,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:40:45,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:45,086 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:45,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:45,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 14:40:45,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 14:40:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391994511] [2022-04-28 14:40:45,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:45,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-28 14:40:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:45,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556632756] [2022-04-28 14:40:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:45,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:45,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298487939] [2022-04-28 14:40:45,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:45,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:45,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:45,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:45,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:40:45,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:45,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:45,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:40:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:45,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:45,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:40:45,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:40:45,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:45,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:45,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,737 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:45,738 INFO L272 TraceCheckUtils]: 18: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,746 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:45,747 INFO L272 TraceCheckUtils]: 23: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,748 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:45,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:40:45,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:40:45,749 INFO L272 TraceCheckUtils]: 30: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:45,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:45,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:40:45,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:40:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:40:45,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:45,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:40:45,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:40:45,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:45,893 INFO L272 TraceCheckUtils]: 30: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:45,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,894 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,895 INFO L272 TraceCheckUtils]: 23: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,896 INFO L272 TraceCheckUtils]: 18: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,896 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,897 INFO L272 TraceCheckUtils]: 13: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:45,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:45,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:40:45,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:40:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:40:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556632756] [2022-04-28 14:40:45,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298487939] [2022-04-28 14:40:45,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298487939] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:40:45,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:40:45,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:40:45,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391994511] [2022-04-28 14:40:45,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391994511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:45,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:45,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829873282] [2022-04-28 14:40:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:40:45,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:45,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:45,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:45,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:45,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:40:45,920 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:46,029 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-28 14:40:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:40:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:46,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:40:46,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:46,057 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:40:46,058 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:40:46,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:46,058 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:46,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:40:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:40:46,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:46,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:46,076 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:46,076 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:46,078 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:40:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:46,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:46,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:46,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:40:46,078 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:40:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:46,080 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:40:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:46,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:46,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:46,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:46,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 14:40:46,081 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-28 14:40:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:46,082 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 14:40:46,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:46,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 14:40:46,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:40:46,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:46,122 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:46,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:46,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:46,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-28 14:40:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:46,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869999158] [2022-04-28 14:40:46,498 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:46,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-28 14:40:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998043788] [2022-04-28 14:40:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:46,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:46,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206510547] [2022-04-28 14:40:46,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:40:46,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:46,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:46,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:46,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:40:46,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:40:46,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:46,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:40:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:46,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:46,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:40:46,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#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(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:40:46,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:40:46,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:46,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:46,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,683 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:46,683 INFO L272 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,684 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:46,684 INFO L272 TraceCheckUtils]: 23: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,685 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:46,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:46,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} assume !false; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:46,686 INFO L272 TraceCheckUtils]: 30: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,691 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1776#(and (= main_~a~0 1) (= main_~s~0 4))} #57#return; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:46,692 INFO L272 TraceCheckUtils]: 35: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:46,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:46,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:40:46,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:40:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:40:46,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:46,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:40:46,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:40:46,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:46,832 INFO L272 TraceCheckUtils]: 35: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:46,833 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:46,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,833 INFO L272 TraceCheckUtils]: 30: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:46,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:46,862 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:46,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,862 INFO L272 TraceCheckUtils]: 23: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,863 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:46,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,863 INFO L272 TraceCheckUtils]: 18: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,864 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:46,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,864 INFO L272 TraceCheckUtils]: 13: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:46,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:46,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:40:46,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#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(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:40:46,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:40:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:40:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998043788] [2022-04-28 14:40:46,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206510547] [2022-04-28 14:40:46,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206510547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:46,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:46,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 14:40:46,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869999158] [2022-04-28 14:40:46,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869999158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:46,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:46,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485509311] [2022-04-28 14:40:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:40:46,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:46,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:46,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:46,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:40:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:40:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:46,892 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:47,097 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 14:40:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:40:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:40:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:40:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:40:47,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 14:40:47,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:47,150 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:40:47,150 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:40:47,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:40:47,151 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:47,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:40:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:40:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 14:40:47,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:47,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:47,170 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:47,170 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:47,172 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:40:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:40:47,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:47,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:47,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:40:47,172 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:40:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:47,174 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:40:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:40:47,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:47,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:47,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:47,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 14:40:47,176 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-28 14:40:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:47,176 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 14:40:47,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:47,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 14:40:47,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:40:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:40:47,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:47,242 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:47,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:47,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-28 14:40:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:47,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063713044] [2022-04-28 14:40:47,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:47,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-28 14:40:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497051796] [2022-04-28 14:40:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:47,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148065403] [2022-04-28 14:40:47,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:40:47,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:47,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:47,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:40:47,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:40:47,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:47,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:40:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:47,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:47,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:40:47,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#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(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:40:47,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:40:47,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:40:47,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:40:47,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:40:47,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:47,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:47,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,814 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:47,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:47,815 INFO L272 TraceCheckUtils]: 23: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,816 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:47,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:47,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} assume !false; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:47,817 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #57#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:47,818 INFO L272 TraceCheckUtils]: 35: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,818 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #59#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:47,819 INFO L272 TraceCheckUtils]: 40: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:47,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:47,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:40:47,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:40:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:40:47,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:47,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:40:47,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:40:47,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:47,966 INFO L272 TraceCheckUtils]: 40: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:47,966 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,967 INFO L272 TraceCheckUtils]: 35: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,967 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,968 INFO L272 TraceCheckUtils]: 30: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,971 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #61#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,971 INFO L272 TraceCheckUtils]: 23: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,972 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,972 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,973 INFO L272 TraceCheckUtils]: 13: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:47,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#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(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:40:47,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:40:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 14:40:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497051796] [2022-04-28 14:40:47,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148065403] [2022-04-28 14:40:47,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148065403] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:40:47,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:40:47,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:40:47,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063713044] [2022-04-28 14:40:47,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063713044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:47,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748765182] [2022-04-28 14:40:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:40:47,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:47,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:47,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:47,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:40:47,994 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:48,150 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 14:40:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:40:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:48,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:40:48,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:48,179 INFO L225 Difference]: With dead ends: 64 [2022-04-28 14:40:48,179 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:40:48,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:48,180 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:48,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:40:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 14:40:48,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:48,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:48,206 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:48,206 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:48,208 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:40:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:48,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:40:48,209 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:40:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:48,210 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:40:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:48,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:48,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:48,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:48,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 14:40:48,212 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-28 14:40:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:48,212 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 14:40:48,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:48,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 14:40:48,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 14:40:48,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:48,279 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:48,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:48,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:48,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-28 14:40:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:48,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172744516] [2022-04-28 14:40:48,621 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:48,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-28 14:40:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:48,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847550019] [2022-04-28 14:40:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:48,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986878255] [2022-04-28 14:40:48,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:48,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:48,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:40:48,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:48,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:40:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:48,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:48,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:40:48,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#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(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:40:48,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:48,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:48,906 INFO L272 TraceCheckUtils]: 13: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,907 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:48,907 INFO L272 TraceCheckUtils]: 18: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,908 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:48,908 INFO L272 TraceCheckUtils]: 23: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,909 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:48,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:48,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !false; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:48,910 INFO L272 TraceCheckUtils]: 30: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,911 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #57#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:48,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,915 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #59#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:48,916 INFO L272 TraceCheckUtils]: 40: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,917 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #61#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:48,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:48,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} assume !false; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:48,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:48,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:48,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:48,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:48,919 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} #57#return; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:48,919 INFO L272 TraceCheckUtils]: 52: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:48,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:48,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:40:48,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:40:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:40:48,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:49,098 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:40:49,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:40:49,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:49,099 INFO L272 TraceCheckUtils]: 52: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:49,100 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:49,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,100 INFO L272 TraceCheckUtils]: 47: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:49,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:49,103 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:49,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,103 INFO L272 TraceCheckUtils]: 40: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L272 TraceCheckUtils]: 35: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,105 INFO L272 TraceCheckUtils]: 30: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:49,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:49,107 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:49,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,107 INFO L272 TraceCheckUtils]: 23: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,108 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:49,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,108 INFO L272 TraceCheckUtils]: 18: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,108 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:49,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,109 INFO L272 TraceCheckUtils]: 13: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:49,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#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(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:40:49,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:40:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:40:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847550019] [2022-04-28 14:40:49,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986878255] [2022-04-28 14:40:49,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986878255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:49,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:49,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 14:40:49,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:49,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172744516] [2022-04-28 14:40:49,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172744516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:49,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:49,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:40:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369929632] [2022-04-28 14:40:49,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:40:49,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:49,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:49,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:49,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:40:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:40:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:40:49,140 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:49,472 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-04-28 14:40:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:40:49,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:40:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:40:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:40:49,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 14:40:49,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:49,518 INFO L225 Difference]: With dead ends: 80 [2022-04-28 14:40:49,518 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:40:49,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:40:49,519 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:49,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:40:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:40:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:40:49,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:49,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:49,567 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:49,567 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:49,569 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:40:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:49,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:49,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:49,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:40:49,570 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:40:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:49,571 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:40:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:49,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:49,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:49,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:49,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-28 14:40:49,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 56 [2022-04-28 14:40:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:49,574 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-28 14:40:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:49,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-28 14:40:49,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 14:40:49,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:49,653 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:49,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:49,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 9 times [2022-04-28 14:40:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792288397] [2022-04-28 14:40:50,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:50,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 10 times [2022-04-28 14:40:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:50,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347431335] [2022-04-28 14:40:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:50,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:50,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995464716] [2022-04-28 14:40:50,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:40:50,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:50,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:50,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:40:50,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:40:50,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:50,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:40:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:50,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:50,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#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(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-28 14:40:50,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:50,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:50,347 INFO L272 TraceCheckUtils]: 13: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,348 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:50,348 INFO L272 TraceCheckUtils]: 18: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,349 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:50,349 INFO L272 TraceCheckUtils]: 23: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,349 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:50,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:50,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} assume !false; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:50,350 INFO L272 TraceCheckUtils]: 30: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #57#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:50,351 INFO L272 TraceCheckUtils]: 35: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #59#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:50,351 INFO L272 TraceCheckUtils]: 40: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,352 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #61#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:50,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:50,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} assume !false; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:50,353 INFO L272 TraceCheckUtils]: 47: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,353 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,353 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #57#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:50,353 INFO L272 TraceCheckUtils]: 52: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #59#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:50,354 INFO L272 TraceCheckUtils]: 57: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,355 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #61#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:50,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-28 14:40:50,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} assume !false; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-28 14:40:50,356 INFO L272 TraceCheckUtils]: 64: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,357 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} #57#return; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-28 14:40:50,357 INFO L272 TraceCheckUtils]: 69: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:50,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:50,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:40:50,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:40:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:40:50,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:50,633 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:40:50,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:40:50,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:50,634 INFO L272 TraceCheckUtils]: 69: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:50,635 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:50,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,635 INFO L272 TraceCheckUtils]: 64: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:50,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:50,638 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:50,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,638 INFO L272 TraceCheckUtils]: 57: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,639 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:50,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,639 INFO L272 TraceCheckUtils]: 52: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,640 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:50,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,640 INFO L272 TraceCheckUtils]: 47: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:50,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:50,643 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:50,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,643 INFO L272 TraceCheckUtils]: 40: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:50,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L272 TraceCheckUtils]: 35: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:50,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,645 INFO L272 TraceCheckUtils]: 30: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:50,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:50,647 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #61#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-28 14:40:50,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,648 INFO L272 TraceCheckUtils]: 23: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,648 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #59#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-28 14:40:50,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,649 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #57#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-28 14:40:50,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,650 INFO L272 TraceCheckUtils]: 13: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} assume !false; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-28 14:40:50,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-28 14:40:50,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-28 14:40:50,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:50,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:50,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:50,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#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(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:40:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:40:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:50,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347431335] [2022-04-28 14:40:50,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:50,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995464716] [2022-04-28 14:40:50,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995464716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:50,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:50,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 14:40:50,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:50,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792288397] [2022-04-28 14:40:50,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792288397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:50,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:50,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:40:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668158031] [2022-04-28 14:40:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:50,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-28 14:40:50,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:50,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:40:50,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:50,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:40:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:40:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:40:50,693 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:40:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:51,216 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-04-28 14:40:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:40:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-28 14:40:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:40:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-28 14:40:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:40:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-28 14:40:51,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2022-04-28 14:40:51,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:51,291 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:40:51,291 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 14:40:51,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:40:51,292 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:51,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 172 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:40:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 14:40:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 14:40:51,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:51,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:51,334 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:51,335 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:51,339 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:40:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:51,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:51,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:51,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 14:40:51,340 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 14:40:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:51,342 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:40:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:51,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:51,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:51,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:51,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-28 14:40:51,345 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 73 [2022-04-28 14:40:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:51,346 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-28 14:40:51,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:40:51,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 97 transitions. [2022-04-28 14:40:51,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 14:40:51,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:51,439 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:51,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:51,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 11 times [2022-04-28 14:40:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:51,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019337707] [2022-04-28 14:40:51,774 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:51,774 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 12 times [2022-04-28 14:40:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:51,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701579970] [2022-04-28 14:40:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:51,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435154627] [2022-04-28 14:40:51,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:40:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:51,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:40:51,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 14:40:51,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:51,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:40:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:51,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:52,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {4749#true} call ULTIMATE.init(); {4749#true} is VALID [2022-04-28 14:40:52,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#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(11, 2);call #Ultimate.allocInit(12, 3); {4749#true} is VALID [2022-04-28 14:40:52,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4749#true} {4749#true} #69#return; {4749#true} is VALID [2022-04-28 14:40:52,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {4749#true} call #t~ret5 := main(); {4749#true} is VALID [2022-04-28 14:40:52,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {4749#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4749#true} is VALID [2022-04-28 14:40:52,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {4749#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4749#true} {4749#true} #55#return; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {4749#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L272 TraceCheckUtils]: 13: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L272 TraceCheckUtils]: 18: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L272 TraceCheckUtils]: 23: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L272 TraceCheckUtils]: 30: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L272 TraceCheckUtils]: 35: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L272 TraceCheckUtils]: 40: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L272 TraceCheckUtils]: 47: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:40:52,178 INFO L272 TraceCheckUtils]: 52: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L272 TraceCheckUtils]: 57: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:40:52,179 INFO L272 TraceCheckUtils]: 64: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L272 TraceCheckUtils]: 69: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:40:52,180 INFO L272 TraceCheckUtils]: 74: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,181 INFO L290 TraceCheckUtils]: 75: Hoare triple {4749#true} ~cond := #in~cond; {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:52,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:52,181 INFO L290 TraceCheckUtils]: 77: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:52,182 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4749#true} #61#return; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:52,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:52,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:52,184 INFO L272 TraceCheckUtils]: 81: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:40:52,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {4749#true} ~cond := #in~cond; {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:52,185 INFO L290 TraceCheckUtils]: 83: Hoare triple {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:52,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:52,187 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-28 14:40:52,187 INFO L272 TraceCheckUtils]: 86: Hoare triple {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:52,188 INFO L290 TraceCheckUtils]: 87: Hoare triple {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:52,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {5020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4750#false} is VALID [2022-04-28 14:40:52,188 INFO L290 TraceCheckUtils]: 89: Hoare triple {4750#false} assume !false; {4750#false} is VALID [2022-04-28 14:40:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-28 14:40:52,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:19,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {4750#false} assume !false; {4750#false} is VALID [2022-04-28 14:41:19,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {5020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4750#false} is VALID [2022-04-28 14:41:19,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:19,848 INFO L272 TraceCheckUtils]: 86: Hoare triple {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:20,254 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} #57#return; {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-28 14:41:20,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:20,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:20,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {4749#true} ~cond := #in~cond; {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:20,255 INFO L272 TraceCheckUtils]: 81: Hoare triple {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !false; {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:20,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {5059#(or (= (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1))) (+ (* main_~s~0 4) 8 (* main_~t~0 4))) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:20,516 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4749#true} #61#return; {5059#(or (= (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1))) (+ (* main_~s~0 4) 8 (* main_~t~0 4))) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:20,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:20,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:20,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {4749#true} ~cond := #in~cond; {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:20,519 INFO L272 TraceCheckUtils]: 74: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L272 TraceCheckUtils]: 69: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L272 TraceCheckUtils]: 64: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:41:20,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L272 TraceCheckUtils]: 57: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L272 TraceCheckUtils]: 52: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L272 TraceCheckUtils]: 47: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L272 TraceCheckUtils]: 40: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L272 TraceCheckUtils]: 35: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L272 TraceCheckUtils]: 30: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L272 TraceCheckUtils]: 23: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,523 INFO L272 TraceCheckUtils]: 18: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L272 TraceCheckUtils]: 13: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {4749#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4749#true} {4749#true} #55#return; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {4749#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {4749#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {4749#true} call #t~ret5 := main(); {4749#true} is VALID [2022-04-28 14:41:20,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4749#true} {4749#true} #69#return; {4749#true} is VALID [2022-04-28 14:41:20,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-28 14:41:20,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#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(11, 2);call #Ultimate.allocInit(12, 3); {4749#true} is VALID [2022-04-28 14:41:20,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {4749#true} call ULTIMATE.init(); {4749#true} is VALID [2022-04-28 14:41:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-28 14:41:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701579970] [2022-04-28 14:41:20,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435154627] [2022-04-28 14:41:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435154627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:20,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:20,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-28 14:41:20,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:20,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019337707] [2022-04-28 14:41:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019337707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:20,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:20,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:41:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477625010] [2022-04-28 14:41:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-28 14:41:20,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:20,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:20,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:41:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:41:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2022-04-28 14:41:20,556 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:21,088 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:41:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:41:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-28 14:41:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 14:41:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 14:41:21,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 14:41:21,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:21,127 INFO L225 Difference]: With dead ends: 93 [2022-04-28 14:41:21,127 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:41:21,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2022-04-28 14:41:21,128 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:21,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:41:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:41:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:41:21,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:21,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:21,129 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:21,129 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:21,129 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:21,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:21,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:21,129 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:21,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:21,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:21,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:21,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:21,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:41:21,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-04-28 14:41:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:21,131 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:41:21,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:21,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:41:21,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:21,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:21,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:41:21,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:41:21,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:41:22,081 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:41:22,081 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:41:22,081 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:41:22,081 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:22,081 INFO L902 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-28 14:41:22,081 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:22,081 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:22,081 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1)))) [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,082 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,083 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,083 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,083 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:22,083 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:41:22,083 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:22,083 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:22,083 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:22,083 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:22,083 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:22,085 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2, 2] [2022-04-28 14:41:22,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:41:22,088 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:41:22,090 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:41:22,098 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:41:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:22 BoogieIcfgContainer [2022-04-28 14:41:22,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:41:22,106 INFO L158 Benchmark]: Toolchain (without parser) took 40337.97ms. Allocated memory was 196.1MB in the beginning and 324.0MB in the end (delta: 127.9MB). Free memory was 142.3MB in the beginning and 257.1MB in the end (delta: -114.8MB). Peak memory consumption was 164.6MB. Max. memory is 8.0GB. [2022-04-28 14:41:22,106 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:41:22,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.77ms. Allocated memory was 196.1MB in the beginning and 269.5MB in the end (delta: 73.4MB). Free memory was 142.1MB in the beginning and 240.6MB in the end (delta: -98.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 14:41:22,106 INFO L158 Benchmark]: Boogie Preprocessor took 38.78ms. Allocated memory is still 269.5MB. Free memory was 240.6MB in the beginning and 239.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:41:22,107 INFO L158 Benchmark]: RCFGBuilder took 278.70ms. Allocated memory is still 269.5MB. Free memory was 239.1MB in the beginning and 228.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:22,107 INFO L158 Benchmark]: TraceAbstraction took 39746.05ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 227.6MB in the beginning and 257.1MB in the end (delta: -29.5MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:22,108 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 196.1MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.77ms. Allocated memory was 196.1MB in the beginning and 269.5MB in the end (delta: 73.4MB). Free memory was 142.1MB in the beginning and 240.6MB in the end (delta: -98.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.78ms. Allocated memory is still 269.5MB. Free memory was 240.6MB in the beginning and 239.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 278.70ms. Allocated memory is still 269.5MB. Free memory was 239.1MB in the beginning and 228.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 39746.05ms. Allocated memory was 269.5MB in the beginning and 324.0MB in the end (delta: 54.5MB). Free memory was 227.6MB in the beginning and 257.1MB in the end (delta: -29.5MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 970 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 304 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 666 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 223 PreInvPairs, 336 NumberOfFragments, 249 HoareAnnotationTreeSize, 223 FomulaSimplifications, 490 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1416 FormulaSimplificationTreeSizeReductionInter, 0.5s 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: 30]: Loop Invariant Derived loop invariant: t * 2 + t * t + 1 == s * 4 && t == a * 2 + 1 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:41:22,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...