/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:37:36,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:37:36,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:37:36,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:37:36,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:37:36,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:37:36,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:37:36,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:37:36,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:37:36,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:37:36,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:37:36,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:37:36,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:37:36,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:37:36,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:37:36,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:37:36,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:37:36,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:37:36,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:37:36,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:37:36,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:37:36,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:37:36,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:37:36,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:37:36,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:37:36,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:37:36,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:37:36,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:37:36,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:37:36,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:37:36,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:37:36,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:37:36,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:37:36,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:37:36,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:37:36,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:37:36,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:37:36,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:37:36,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:37:36,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:37:36,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:37:36,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:37:36,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:37:36,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:37:36,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:37:36,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:37:36,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:37:36,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:37:36,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:37:36,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:37:36,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:37:36,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:37:36,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:37:36,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:37:36,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:36,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:37:36,335 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:37:36,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:37:36,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:37:36,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:37:36,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:37:36,581 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:37:36,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-08 14:37:36,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dfa58746/b0b42ace343d4d80b7e2219c9a788b5d/FLAGcb854d165 [2022-04-08 14:37:37,009 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:37:37,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-08 14:37:37,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dfa58746/b0b42ace343d4d80b7e2219c9a788b5d/FLAGcb854d165 [2022-04-08 14:37:37,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dfa58746/b0b42ace343d4d80b7e2219c9a788b5d [2022-04-08 14:37:37,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:37:37,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:37:37,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:37,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:37:37,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:37:37,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c29f968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37, skipping insertion in model container [2022-04-08 14:37:37,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:37:37,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:37:37,172 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_valuebound10.c[520,533] [2022-04-08 14:37:37,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:37,199 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:37:37,207 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_valuebound10.c[520,533] [2022-04-08 14:37:37,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:37,229 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:37:37,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37 WrapperNode [2022-04-08 14:37:37,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:37,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:37:37,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:37:37,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:37:37,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:37:37,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:37:37,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:37:37,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:37:37,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (1/1) ... [2022-04-08 14:37:37,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:37,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:37:37,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:37:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:37:37,348 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:37:37,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:37:37,510 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:37:37,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:37:37,515 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:37:37,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:37 BoogieIcfgContainer [2022-04-08 14:37:37,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:37:37,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:37:37,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:37:37,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:37:37,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:37:37" (1/3) ... [2022-04-08 14:37:37,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129283d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:37, skipping insertion in model container [2022-04-08 14:37:37,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:37" (2/3) ... [2022-04-08 14:37:37,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129283d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:37, skipping insertion in model container [2022-04-08 14:37:37,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:37" (3/3) ... [2022-04-08 14:37:37,523 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound10.c [2022-04-08 14:37:37,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:37:37,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:37:37,576 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:37:37,582 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:37:37,583 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:37:37,609 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-08 14:37:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:37:37,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:37,615 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:37,616 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-08 14:37:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:37,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026018311] [2022-04-08 14:37:37,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-08 14:37:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:37,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279130725] [2022-04-08 14:37:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:37,824 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-08 14:37:37,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 14:37:37,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-08 14:37:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:37:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:37,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 14:37:37,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 14:37:37,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 14:37:37,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-08 14:37:37,837 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-08 14:37:37,837 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-08 14:37:37,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 14:37:37,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-08 14:37:37,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-08 14:37:37,838 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-08 14:37:37,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-08 14:37:37,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 14:37:37,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 14:37:37,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 14:37:37,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-08 14:37:37,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-08 14:37:37,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-08 14:37:37,842 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-08 14:37:37,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 14:37:37,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 14:37:37,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 14:37:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:37,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279130725] [2022-04-08 14:37:37,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279130725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:37,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:37,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:37,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:37,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026018311] [2022-04-08 14:37:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026018311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:37,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:37,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:37,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059165761] [2022-04-08 14:37:37,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:37,854 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-08 14:37:37,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:37,857 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-08 14:37:37,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:37,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:37:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:37:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:37:37,909 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-08 14:37:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,075 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-08 14:37:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:37:38,076 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-08 14:37:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:38,077 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-08 14:37:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 14:37:38,089 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-08 14:37:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 14:37:38,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-08 14:37:38,168 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-08 14:37:38,174 INFO L225 Difference]: With dead ends: 53 [2022-04-08 14:37:38,175 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:37:38,177 INFO L912 BasicCegarLoop]: 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-08 14:37:38,179 INFO L913 BasicCegarLoop]: 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-08 14:37:38,180 INFO L914 BasicCegarLoop]: 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-08 14:37:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:37:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:37:38,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:38,240 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-08 14:37:38,240 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-08 14:37:38,241 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-08 14:37:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,245 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 14:37:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:38,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:38,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:38,246 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-08 14:37:38,246 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-08 14:37:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,250 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 14:37:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:38,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:38,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:38,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:38,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:38,252 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-08 14:37:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-08 14:37:38,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-08 14:37:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:38,269 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-08 14:37:38,269 INFO L479 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-08 14:37:38,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-08 14:37:38,312 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-08 14:37:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:37:38,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:38,313 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:38,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:37:38,314 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-08 14:37:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:38,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198700478] [2022-04-08 14:37:38,315 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-08 14:37:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:38,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358982254] [2022-04-08 14:37:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:38,443 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-08 14:37:38,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:38,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-08 14:37:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:37:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:38,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-08 14:37:38,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-08 14:37:38,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:38,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-08 14:37:38,450 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-08 14:37:38,451 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-08 14:37:38,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:38,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-08 14:37:38,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-08 14:37:38,451 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-08 14:37:38,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {256#true} is VALID [2022-04-08 14:37:38,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-08 14:37:38,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-08 14:37:38,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:38,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-08 14:37:38,453 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-08 14:37:38,453 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-08 14:37:38,454 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-08 14:37:38,455 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-08 14:37:38,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-08 14:37:38,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-08 14:37:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:38,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358982254] [2022-04-08 14:37:38,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358982254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:38,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:38,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:38,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198700478] [2022-04-08 14:37:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198700478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:38,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:38,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085985547] [2022-04-08 14:37:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:38,458 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-08 14:37:38,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:38,458 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-08 14:37:38,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:38,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:37:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:37:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:38,471 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-08 14:37:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,855 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 14:37:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:37:38,856 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-08 14:37:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:38,856 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-08 14:37:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 14:37:38,859 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-08 14:37:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 14:37:38,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-08 14:37:38,908 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-08 14:37:38,910 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:37:38,910 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:37:38,911 INFO L912 BasicCegarLoop]: 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-08 14:37:38,911 INFO L913 BasicCegarLoop]: 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-08 14:37:38,912 INFO L914 BasicCegarLoop]: 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-08 14:37:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:37:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-08 14:37:38,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:38,920 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-08 14:37:38,920 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-08 14:37:38,920 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-08 14:37:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,923 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:38,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:38,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:38,925 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-08 14:37:38,925 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-08 14:37:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:38,928 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:38,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:38,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:38,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:38,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:38,929 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-08 14:37:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 14:37:38,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-08 14:37:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:38,932 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 14:37:38,932 INFO L479 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-08 14:37:38,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 14:37:38,990 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-08 14:37:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 14:37:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:37:38,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:38,992 INFO L499 BasicCegarLoop]: 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-08 14:37:38,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:37:38,992 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-08 14:37:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:38,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1464123515] [2022-04-08 14:37:38,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-08 14:37:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605784427] [2022-04-08 14:37:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:39,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:39,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562504767] [2022-04-08 14:37:39,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:39,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:39,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:39,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:37:39,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:39,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:39,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:39,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:39,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-08 14:37:39,244 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-08 14:37:39,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:39,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-08 14:37:39,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-08 14:37:39,245 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-08 14:37:39,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {507#true} is VALID [2022-04-08 14:37:39,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-08 14:37:39,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-08 14:37:39,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:39,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-08 14:37:39,260 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-08 14:37:39,260 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-08 14:37:39,260 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-08 14:37:39,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-08 14:37:39,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-08 14:37:39,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:39,262 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-08 14:37:39,262 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-08 14:37:39,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:39,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-08 14:37:39,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-08 14:37:39,264 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-08 14:37:39,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605784427] [2022-04-08 14:37:39,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562504767] [2022-04-08 14:37:39,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562504767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:39,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:39,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:39,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:39,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1464123515] [2022-04-08 14:37:39,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1464123515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:39,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:39,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:39,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405797545] [2022-04-08 14:37:39,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:39,266 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-08 14:37:39,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:39,267 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-08 14:37:39,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:39,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:39,296 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-08 14:37:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:39,447 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 14:37:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:39,447 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-08 14:37:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:39,448 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-08 14:37:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:39,450 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-08 14:37:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:39,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 14:37:39,485 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-08 14:37:39,487 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:37:39,487 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 14:37:39,487 INFO L912 BasicCegarLoop]: 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-08 14:37:39,488 INFO L913 BasicCegarLoop]: 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-08 14:37:39,488 INFO L914 BasicCegarLoop]: 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-08 14:37:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 14:37:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-08 14:37:39,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:39,502 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-08 14:37:39,502 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-08 14:37:39,503 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-08 14:37:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:39,509 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 14:37:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 14:37:39,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:39,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:39,510 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-08 14:37:39,510 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-08 14:37:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:39,512 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 14:37:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 14:37:39,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:39,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:39,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:39,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:39,513 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-08 14:37:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-08 14:37:39,515 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-08 14:37:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:39,515 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-08 14:37:39,516 INFO L479 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-08 14:37:39,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-08 14:37:39,558 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-08 14:37:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-08 14:37:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:37:39,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:39,559 INFO L499 BasicCegarLoop]: 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-08 14:37:39,579 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-08 14:37:39,775 WARN L460 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-08 14:37:39,776 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-08 14:37:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:39,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706940573] [2022-04-08 14:37:39,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-08 14:37:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:39,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994468690] [2022-04-08 14:37:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:39,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:39,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236822840] [2022-04-08 14:37:39,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:39,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:39,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:39,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:37:39,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:39,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:39,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:39,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:39,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-08 14:37:39,952 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-08 14:37:39,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:39,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-08 14:37:39,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-08 14:37:39,953 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-08 14:37:39,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {833#true} is VALID [2022-04-08 14:37:39,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:39,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:39,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:39,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-08 14:37:39,954 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-08 14:37:39,954 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-08 14:37:39,954 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-08 14:37:39,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:39,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:39,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:39,957 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-08 14:37:39,957 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-08 14:37:39,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:39,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:39,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:39,958 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-08 14:37:39,959 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-08 14:37:39,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:39,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-08 14:37:39,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-08 14:37:39,961 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-08 14:37:39,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994468690] [2022-04-08 14:37:39,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236822840] [2022-04-08 14:37:39,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236822840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:39,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:39,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:39,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:39,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706940573] [2022-04-08 14:37:39,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706940573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:39,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:39,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543880074] [2022-04-08 14:37:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:39,964 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-08 14:37:39,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:39,964 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-08 14:37:39,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:39,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:39,981 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-08 14:37:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:40,111 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 14:37:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:40,112 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-08 14:37:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:40,112 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-08 14:37:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:40,117 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-08 14:37:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:40,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 14:37:40,151 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-08 14:37:40,153 INFO L225 Difference]: With dead ends: 48 [2022-04-08 14:37:40,153 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 14:37:40,155 INFO L912 BasicCegarLoop]: 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-08 14:37:40,158 INFO L913 BasicCegarLoop]: 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-08 14:37:40,159 INFO L914 BasicCegarLoop]: 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-08 14:37:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 14:37:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 14:37:40,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:40,177 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-08 14:37:40,179 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-08 14:37:40,180 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-08 14:37:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:40,184 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:37:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:40,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:40,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:40,188 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-08 14:37:40,188 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-08 14:37:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:40,192 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:37:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:40,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:40,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:40,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:40,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:40,194 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-08 14:37:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 14:37:40,196 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-08 14:37:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:40,212 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 14:37:40,213 INFO L479 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-08 14:37:40,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-08 14:37:40,250 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-08 14:37:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:37:40,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:40,252 INFO L499 BasicCegarLoop]: 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-08 14:37:40,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:40,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 14:37:40,469 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-08 14:37:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:40,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994392237] [2022-04-08 14:37:40,714 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:40,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-08 14:37:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:40,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076833282] [2022-04-08 14:37:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:40,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:40,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936471316] [2022-04-08 14:37:40,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:40,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:40,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:37:40,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:40,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:40,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:37:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:40,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:40,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-08 14:37:40,893 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-08 14:37:40,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:40,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-08 14:37:40,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-08 14:37:40,896 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-08 14:37:40,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:40,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:40,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:40,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:40,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-08 14:37:40,897 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-08 14:37:40,897 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-08 14:37:40,897 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-08 14:37:40,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:40,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:40,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:40,900 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-08 14:37:40,901 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-08 14:37:40,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:40,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:40,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:40,911 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-08 14:37:40,911 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-08 14:37:40,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:40,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:40,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:40,912 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-08 14:37:40,912 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-08 14:37:40,913 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-08 14:37:40,913 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-08 14:37:40,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:40,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-08 14:37:40,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-08 14:37:40,915 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-08 14:37:40,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:41,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-08 14:37:41,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-08 14:37:41,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:41,047 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-08 14:37:41,048 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-08 14:37:41,048 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-08 14:37:41,049 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-08 14:37:41,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:41,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:41,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:41,049 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-08 14:37:41,050 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-08 14:37:41,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:41,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:41,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:41,050 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-08 14:37:41,051 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-08 14:37:41,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:41,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:41,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:41,051 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-08 14:37:41,051 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-08 14:37:41,052 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-08 14:37:41,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-08 14:37:41,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:41,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:41,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:41,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:41,052 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-08 14:37:41,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-08 14:37:41,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-08 14:37:41,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:41,053 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-08 14:37:41,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-08 14:37:41,053 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-08 14:37:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076833282] [2022-04-08 14:37:41,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936471316] [2022-04-08 14:37:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936471316] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:37:41,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:37:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:37:41,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:41,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994392237] [2022-04-08 14:37:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994392237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:41,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993534323] [2022-04-08 14:37:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:41,055 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-08 14:37:41,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:41,055 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-08 14:37:41,073 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-08 14:37:41,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:37:41,074 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-08 14:37:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:41,201 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-08 14:37:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:41,201 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-08 14:37:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:41,202 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-08 14:37:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:41,203 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-08 14:37:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:41,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 14:37:41,228 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-08 14:37:41,229 INFO L225 Difference]: With dead ends: 49 [2022-04-08 14:37:41,230 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:37:41,230 INFO L912 BasicCegarLoop]: 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-08 14:37:41,230 INFO L913 BasicCegarLoop]: 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-08 14:37:41,231 INFO L914 BasicCegarLoop]: 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-08 14:37:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:37:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 14:37:41,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:41,247 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-08 14:37:41,248 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-08 14:37:41,248 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-08 14:37:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:41,249 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:37:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:41,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:41,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:41,250 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-08 14:37:41,250 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-08 14:37:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:41,251 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:37:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:41,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:41,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:41,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:41,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:41,252 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-08 14:37:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 14:37:41,253 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-08 14:37:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:41,253 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 14:37:41,253 INFO L479 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-08 14:37:41,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-08 14:37:41,296 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-08 14:37:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:37:41,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:41,297 INFO L499 BasicCegarLoop]: 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-08 14:37:41,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:41,511 WARN L460 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-08 14:37:41,511 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-08 14:37:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:41,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459340777] [2022-04-08 14:37:41,660 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:41,660 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-08 14:37:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058572110] [2022-04-08 14:37:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:41,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:41,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356533758] [2022-04-08 14:37:41,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:37:41,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:41,671 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-08 14:37:41,672 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-08 14:37:41,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:37:41,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:41,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:37:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:41,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:41,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-08 14:37:41,857 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-08 14:37:41,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-08 14:37:41,858 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-08 14:37:41,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-08 14:37:41,859 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-08 14:37:41,859 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-08 14:37:41,860 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-08 14:37:41,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:41,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:41,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,861 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-08 14:37:41,861 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-08 14:37:41,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:41,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:41,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,861 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-08 14:37:41,862 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-08 14:37:41,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:41,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:41,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,862 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-08 14:37:41,863 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-08 14:37:41,863 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-08 14:37:41,863 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-08 14:37:41,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:41,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:41,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:41,868 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-08 14:37:41,868 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-08 14:37:41,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:41,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-08 14:37:41,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-08 14:37:41,869 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-08 14:37:41,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:42,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-08 14:37:42,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-08 14:37:42,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:42,037 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-08 14:37:42,037 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-08 14:37:42,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:42,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:42,038 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-08 14:37:42,038 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-08 14:37:42,059 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-08 14:37:42,060 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-08 14:37:42,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:42,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:42,060 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-08 14:37:42,060 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-08 14:37:42,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:42,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:42,061 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-08 14:37:42,062 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-08 14:37:42,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:42,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:42,062 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-08 14:37:42,063 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-08 14:37:42,063 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-08 14:37:42,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-08 14:37:42,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:42,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:42,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:42,064 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-08 14:37:42,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-08 14:37:42,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-08 14:37:42,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:42,064 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-08 14:37:42,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-08 14:37:42,064 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-08 14:37:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:42,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058572110] [2022-04-08 14:37:42,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:42,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356533758] [2022-04-08 14:37:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356533758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:42,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 14:37:42,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:42,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459340777] [2022-04-08 14:37:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459340777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:42,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122422979] [2022-04-08 14:37:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:42,066 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-08 14:37:42,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:42,066 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-08 14:37:42,092 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-08 14:37:42,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:37:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:37:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:42,093 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-08 14:37:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:42,326 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-08 14:37:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:37:42,326 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-08 14:37:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:42,326 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-08 14:37:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 14:37:42,327 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-08 14:37:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 14:37:42,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 14:37:42,373 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-08 14:37:42,374 INFO L225 Difference]: With dead ends: 61 [2022-04-08 14:37:42,374 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 14:37:42,374 INFO L912 BasicCegarLoop]: 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-08 14:37:42,375 INFO L913 BasicCegarLoop]: 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-08 14:37:42,375 INFO L914 BasicCegarLoop]: 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-08 14:37:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 14:37:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 14:37:42,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:42,397 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-08 14:37:42,397 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-08 14:37:42,397 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-08 14:37:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:42,399 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 14:37:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-08 14:37:42,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:42,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:42,400 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-08 14:37:42,400 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-08 14:37:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:42,401 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 14:37:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-08 14:37:42,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:42,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:42,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:42,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:42,402 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-08 14:37:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-08 14:37:42,404 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-08 14:37:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:42,404 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-08 14:37:42,404 INFO L479 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-08 14:37:42,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-08 14:37:42,467 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-08 14:37:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 14:37:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 14:37:42,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:42,467 INFO L499 BasicCegarLoop]: 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-08 14:37:42,484 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-08 14:37:42,668 WARN L460 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-08 14:37:42,668 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-08 14:37:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:42,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687447545] [2022-04-08 14:37:42,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:42,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-08 14:37:42,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:42,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475207427] [2022-04-08 14:37:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:42,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:42,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:42,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261915119] [2022-04-08 14:37:42,868 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:37:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:42,869 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-08 14:37:42,870 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-08 14:37:42,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 14:37:42,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:42,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:37:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:43,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-08 14:37:43,054 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-08 14:37:43,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-08 14:37:43,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-08 14:37:43,055 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-08 14:37:43,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:43,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-08 14:37:43,057 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-08 14:37:43,059 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-08 14:37:43,059 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-08 14:37:43,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,060 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-08 14:37:43,060 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-08 14:37:43,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,060 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-08 14:37:43,061 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-08 14:37:43,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,061 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-08 14:37:43,062 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-08 14:37:43,062 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-08 14:37:43,062 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-08 14:37:43,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,063 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-08 14:37:43,063 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-08 14:37:43,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,063 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-08 14:37:43,064 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-08 14:37:43,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:43,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-08 14:37:43,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-08 14:37:43,066 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-08 14:37:43,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:43,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-08 14:37:43,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-08 14:37:43,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:43,220 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-08 14:37:43,220 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-08 14:37:43,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,220 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-08 14:37:43,221 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-08 14:37:43,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,221 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-08 14:37:43,221 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-08 14:37:43,223 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-08 14:37:43,224 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-08 14:37:43,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,224 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-08 14:37:43,226 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-08 14:37:43,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,226 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-08 14:37:43,226 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-08 14:37:43,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,227 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-08 14:37:43,227 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-08 14:37:43,227 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-08 14:37:43,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:43,228 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-08 14:37:43,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-08 14:37:43,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:43,228 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-08 14:37:43,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-08 14:37:43,228 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-08 14:37:43,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475207427] [2022-04-08 14:37:43,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261915119] [2022-04-08 14:37:43,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261915119] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:37:43,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:37:43,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:37:43,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687447545] [2022-04-08 14:37:43,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687447545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:43,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:43,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637006279] [2022-04-08 14:37:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:43,230 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-08 14:37:43,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:43,230 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-08 14:37:43,247 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-08 14:37:43,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:37:43,248 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-08 14:37:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:43,395 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-08 14:37:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:43,395 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-08 14:37:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:43,395 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-08 14:37:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:43,396 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-08 14:37:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:43,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 14:37:43,422 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-08 14:37:43,423 INFO L225 Difference]: With dead ends: 64 [2022-04-08 14:37:43,424 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 14:37:43,424 INFO L912 BasicCegarLoop]: 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-08 14:37:43,424 INFO L913 BasicCegarLoop]: 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-08 14:37:43,425 INFO L914 BasicCegarLoop]: 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-08 14:37:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 14:37:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 14:37:43,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:43,449 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-08 14:37:43,449 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-08 14:37:43,449 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-08 14:37:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:43,450 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-08 14:37:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:43,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:43,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:43,451 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-08 14:37:43,451 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-08 14:37:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:43,453 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-08 14:37:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:43,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:43,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:43,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:43,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:43,453 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-08 14:37:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-08 14:37:43,455 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-08 14:37:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:43,455 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-08 14:37:43,455 INFO L479 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-08 14:37:43,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-08 14:37:43,541 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-08 14:37:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 14:37:43,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:43,542 INFO L499 BasicCegarLoop]: 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-08 14:37:43,558 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-08 14:37:43,742 WARN L460 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-08 14:37:43,742 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-08 14:37:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570846417] [2022-04-08 14:37:43,894 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:43,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-08 14:37:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248437975] [2022-04-08 14:37:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:43,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:43,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219270333] [2022-04-08 14:37:43,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:43,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:43,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:43,904 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-08 14:37:43,905 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-08 14:37:43,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:43,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:43,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:37:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:43,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:44,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-08 14:37:44,150 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-08 14:37:44,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-08 14:37:44,150 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-08 14:37:44,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-08 14:37:44,151 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-08 14:37:44,151 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-08 14:37:44,151 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-08 14:37:44,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,152 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-08 14:37:44,152 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-08 14:37:44,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,152 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-08 14:37:44,153 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-08 14:37:44,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,153 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-08 14:37:44,154 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-08 14:37:44,154 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-08 14:37:44,154 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-08 14:37:44,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,155 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-08 14:37:44,155 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-08 14:37:44,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,155 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-08 14:37:44,156 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-08 14:37:44,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,160 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-08 14:37:44,161 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-08 14:37:44,162 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-08 14:37:44,162 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-08 14:37:44,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,162 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-08 14:37:44,163 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-08 14:37:44,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:44,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-08 14:37:44,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-08 14:37:44,164 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-08 14:37:44,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:44,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-08 14:37:44,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-08 14:37:44,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:44,380 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-08 14:37:44,381 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-08 14:37:44,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,381 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-08 14:37:44,381 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-08 14:37:44,384 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-08 14:37:44,385 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-08 14:37:44,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,385 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-08 14:37:44,386 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-08 14:37:44,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,386 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-08 14:37:44,386 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-08 14:37:44,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,387 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-08 14:37:44,387 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-08 14:37:44,389 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-08 14:37:44,389 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-08 14:37:44,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,390 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-08 14:37:44,390 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-08 14:37:44,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,390 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-08 14:37:44,391 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-08 14:37:44,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,391 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-08 14:37:44,392 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-08 14:37:44,392 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-08 14:37:44,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:44,392 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-08 14:37:44,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-08 14:37:44,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:44,392 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-08 14:37:44,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-08 14:37:44,393 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-08 14:37:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:44,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248437975] [2022-04-08 14:37:44,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:44,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219270333] [2022-04-08 14:37:44,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219270333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:44,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:44,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 14:37:44,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:44,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570846417] [2022-04-08 14:37:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570846417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:44,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:44,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:37:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934168883] [2022-04-08 14:37:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:44,394 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-08 14:37:44,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:44,394 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-08 14:37:44,435 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-08 14:37:44,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:37:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:37:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:37:44,436 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-08 14:37:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:44,793 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-04-08 14:37:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:37:44,793 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-08 14:37:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:44,794 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-08 14:37:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 14:37:44,795 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-08 14:37:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 14:37:44,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-08 14:37:44,846 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-08 14:37:44,848 INFO L225 Difference]: With dead ends: 80 [2022-04-08 14:37:44,848 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:37:44,848 INFO L912 BasicCegarLoop]: 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-08 14:37:44,848 INFO L913 BasicCegarLoop]: 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-08 14:37:44,849 INFO L914 BasicCegarLoop]: 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-08 14:37:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:37:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:37:44,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:44,888 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-08 14:37:44,888 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-08 14:37:44,889 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-08 14:37:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:44,891 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:37:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:44,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:44,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:44,896 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-08 14:37:44,897 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-08 14:37:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:44,899 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:37:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:44,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:44,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:44,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:44,900 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-08 14:37:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-08 14:37:44,902 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 56 [2022-04-08 14:37:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:44,902 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-08 14:37:44,902 INFO L479 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-08 14:37:44,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-08 14:37:44,984 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-08 14:37:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 14:37:44,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:44,984 INFO L499 BasicCegarLoop]: 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-08 14:37:45,001 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-08 14:37:45,195 WARN L460 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-08 14:37:45,196 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 9 times [2022-04-08 14:37:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:45,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448636942] [2022-04-08 14:37:45,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:45,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 10 times [2022-04-08 14:37:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:45,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538998210] [2022-04-08 14:37:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:45,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:45,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565559704] [2022-04-08 14:37:45,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:37:45,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:45,388 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-08 14:37:45,389 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-08 14:37:45,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:37:45,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:45,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 14:37:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:45,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:45,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-08 14:37:45,802 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-08 14:37:45,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-08 14:37:45,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-08 14:37:45,802 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-08 14:37:45,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:45,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-08 14:37:45,803 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-08 14:37:45,803 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-08 14:37:45,803 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-08 14:37:45,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,804 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-08 14:37:45,804 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-08 14:37:45,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,805 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-08 14:37:45,805 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-08 14:37:45,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,805 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-08 14:37:45,806 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-08 14:37:45,806 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-08 14:37:45,806 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-08 14:37:45,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,807 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-08 14:37:45,807 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-08 14:37:45,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,808 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-08 14:37:45,808 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-08 14:37:45,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,808 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-08 14:37:45,809 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_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:45,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} assume !false; {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:45,809 INFO L272 TraceCheckUtils]: 47: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 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-08 14:37:45,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,810 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} #57#return; {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:45,810 INFO L272 TraceCheckUtils]: 52: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 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-08 14:37:45,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3899#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:45,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:45,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:45,811 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} #59#return; {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} is VALID [2022-04-08 14:37:45,811 INFO L272 TraceCheckUtils]: 57: Hoare triple {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~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-08 14:37:45,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,812 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} #61#return; {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} is VALID [2022-04-08 14:37:45,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-08 14:37:45,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} assume !false; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-08 14:37:45,812 INFO L272 TraceCheckUtils]: 64: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:45,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:45,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:45,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:45,813 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} #57#return; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-08 14:37:45,813 INFO L272 TraceCheckUtils]: 69: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:45,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:45,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {3955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-08 14:37:45,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-08 14:37:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 40 proven. 31 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 14:37:45,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:46,307 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-08 14:37:46,309 INFO L290 TraceCheckUtils]: 71: Hoare triple {3955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-08 14:37:46,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:46,310 INFO L272 TraceCheckUtils]: 69: Hoare triple {3971#(= (+ (* 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)); {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:46,311 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:46,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,311 INFO L272 TraceCheckUtils]: 64: Hoare triple {3971#(= (+ (* 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-08 14:37:46,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:46,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {3993#(= (+ (* (+ 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; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:46,314 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:46,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,314 INFO L272 TraceCheckUtils]: 57: Hoare triple {3993#(= (+ (* (+ 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-08 14:37:46,315 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} #59#return; {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:46,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:46,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {4022#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:46,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {4022#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:37:46,316 INFO L272 TraceCheckUtils]: 52: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ 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-08 14:37:46,317 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} #57#return; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-08 14:37:46,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,317 INFO L272 TraceCheckUtils]: 47: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ 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-08 14:37:46,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} assume !false; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-08 14:37:46,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-08 14:37:46,320 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #61#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-08 14:37:46,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,321 INFO L272 TraceCheckUtils]: 40: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~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-08 14:37:46,321 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #59#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-08 14:37:46,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,321 INFO L272 TraceCheckUtils]: 35: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:46,322 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #57#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-08 14:37:46,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,322 INFO L272 TraceCheckUtils]: 30: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:46,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} assume !false; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-08 14:37:46,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-08 14:37:46,325 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #61#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L272 TraceCheckUtils]: 23: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~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-08 14:37:46,326 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #59#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,326 INFO L272 TraceCheckUtils]: 18: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:46,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #57#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-08 14:37:46,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:46,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} assume !false; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-08 14:37:46,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-08 14:37:46,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-08 14:37:46,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:46,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:46,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:46,329 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-08 14:37:46,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-08 14:37:46,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-08 14:37:46,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:46,329 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-08 14:37:46,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-08 14:37:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 48 proven. 23 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-08 14:37:46,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538998210] [2022-04-08 14:37:46,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565559704] [2022-04-08 14:37:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565559704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:46,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-08 14:37:46,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448636942] [2022-04-08 14:37:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448636942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:46,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:37:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311748043] [2022-04-08 14:37:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 73 [2022-04-08 14:37:46,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:46,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 14:37:46,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:46,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:37:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:37:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:37:46,369 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 14:37:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:47,195 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-04-08 14:37:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:37:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 73 [2022-04-08 14:37:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 14:37:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-08 14:37:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 14:37:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-08 14:37:47,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2022-04-08 14:37:47,262 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-08 14:37:47,273 INFO L225 Difference]: With dead ends: 97 [2022-04-08 14:37:47,273 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 14:37:47,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:37:47,275 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:47,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:37:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 14:37:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 14:37:47,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:47,321 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-08 14:37:47,321 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-08 14:37:47,322 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-08 14:37:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:47,327 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:37:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:47,329 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-08 14:37:47,329 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-08 14:37:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:47,331 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:37:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:47,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:47,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:47,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:47,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:47,332 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-08 14:37:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-08 14:37:47,333 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 73 [2022-04-08 14:37:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:47,333 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-08 14:37:47,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 14:37:47,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 97 transitions. [2022-04-08 14:37:47,440 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-08 14:37:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 14:37:47,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:47,441 INFO L499 BasicCegarLoop]: 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-08 14:37:47,460 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-08 14:37:47,655 WARN L460 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-08 14:37:47,655 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 11 times [2022-04-08 14:37:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:47,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654737655] [2022-04-08 14:37:47,793 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:47,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 12 times [2022-04-08 14:37:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:47,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745253070] [2022-04-08 14:37:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:47,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:47,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469530643] [2022-04-08 14:37:47,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:37:47,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:47,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:47,810 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-08 14:37:47,812 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-08 14:37:47,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:37:47,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:47,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:37:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:47,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:48,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {4756#true} call ULTIMATE.init(); {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#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); {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4756#true} {4756#true} #69#return; {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {4756#true} call #t~ret5 := main(); {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#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; {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {4756#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4756#true} {4756#true} #55#return; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {4756#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L272 TraceCheckUtils]: 13: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L272 TraceCheckUtils]: 18: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L272 TraceCheckUtils]: 23: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L272 TraceCheckUtils]: 30: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L272 TraceCheckUtils]: 35: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L272 TraceCheckUtils]: 40: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,090 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L272 TraceCheckUtils]: 47: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L272 TraceCheckUtils]: 52: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L272 TraceCheckUtils]: 57: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,091 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:37:48,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:37:48,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:37:48,092 INFO L272 TraceCheckUtils]: 64: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L272 TraceCheckUtils]: 69: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:37:48,094 INFO L272 TraceCheckUtils]: 74: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:37:48,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {4756#true} ~cond := #in~cond; {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:48,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:48,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:48,096 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4756#true} #61#return; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:48,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {4997#(= (+ (* 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; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:48,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:48,098 INFO L272 TraceCheckUtils]: 81: Hoare triple {4997#(= (+ (* 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)); {4756#true} is VALID [2022-04-08 14:37:48,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {4756#true} ~cond := #in~cond; {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:48,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:48,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:48,101 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-08 14:37:48,101 INFO L272 TraceCheckUtils]: 86: Hoare triple {5019#(= (* 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)); {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:48,101 INFO L290 TraceCheckUtils]: 87: Hoare triple {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5027#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:48,102 INFO L290 TraceCheckUtils]: 88: Hoare triple {5027#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4757#false} is VALID [2022-04-08 14:37:48,102 INFO L290 TraceCheckUtils]: 89: Hoare triple {4757#false} assume !false; {4757#false} is VALID [2022-04-08 14:37:48,102 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-08 14:37:48,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:38:28,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {4757#false} assume !false; {4757#false} is VALID [2022-04-08 14:38:28,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {5027#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4757#false} is VALID [2022-04-08 14:38:28,705 INFO L290 TraceCheckUtils]: 87: Hoare triple {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5027#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:38:28,705 INFO L272 TraceCheckUtils]: 86: Hoare triple {5019#(= (* 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)); {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:38:29,526 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {5046#(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; {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-08 14:38:29,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:29,527 INFO L290 TraceCheckUtils]: 83: Hoare triple {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:29,528 INFO L290 TraceCheckUtils]: 82: Hoare triple {4756#true} ~cond := #in~cond; {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:38:29,528 INFO L272 TraceCheckUtils]: 81: Hoare triple {5046#(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)); {4756#true} is VALID [2022-04-08 14:38:29,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {5046#(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; {5046#(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-08 14:38:29,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {5066#(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; {5046#(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-08 14:38:29,826 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4756#true} #61#return; {5066#(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-08 14:38:29,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:29,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:29,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {4756#true} ~cond := #in~cond; {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:38:29,827 INFO L272 TraceCheckUtils]: 74: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,827 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L272 TraceCheckUtils]: 69: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L272 TraceCheckUtils]: 64: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,828 INFO L272 TraceCheckUtils]: 57: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L272 TraceCheckUtils]: 52: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L272 TraceCheckUtils]: 47: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L272 TraceCheckUtils]: 40: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L272 TraceCheckUtils]: 35: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L272 TraceCheckUtils]: 30: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L272 TraceCheckUtils]: 23: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L272 TraceCheckUtils]: 18: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L272 TraceCheckUtils]: 13: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {4756#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4756#true} {4756#true} #55#return; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {4756#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#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; {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {4756#true} call #t~ret5 := main(); {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4756#true} {4756#true} #69#return; {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#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); {4756#true} is VALID [2022-04-08 14:38:29,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {4756#true} call ULTIMATE.init(); {4756#true} is VALID [2022-04-08 14:38:29,832 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-08 14:38:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:38:29,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745253070] [2022-04-08 14:38:29,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:38:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469530643] [2022-04-08 14:38:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469530643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:38:29,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:38:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-08 14:38:29,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:38:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654737655] [2022-04-08 14:38:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654737655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:38:29,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:38:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:38:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695528909] [2022-04-08 14:38:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:38:29,834 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-08 14:38:29,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:38:29,834 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-08 14:38:29,866 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-08 14:38:29,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:38:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:38:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:38:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2022-04-08 14:38:29,867 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-08 14:38:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:30,365 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:38:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:38:30,365 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-08 14:38:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:38:30,365 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-08 14:38:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:38:30,366 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-08 14:38:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:38:30,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 14:38:30,398 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-08 14:38:30,398 INFO L225 Difference]: With dead ends: 93 [2022-04-08 14:38:30,398 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:38:30,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2022-04-08 14:38:30,399 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:38:30,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:38:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:38:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:38:30,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:38:30,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:30,400 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:30,400 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:30,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:38:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:30,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:30,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:38:30,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:38:30,400 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:38:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:30,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:38:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:30,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:30,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:38:30,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:38:30,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:38:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:38:30,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-04-08 14:38:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:38:30,401 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:38:30,401 INFO L479 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-08 14:38:30,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:38:30,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:38:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:30,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:30,403 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:38:30,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 14:38:30,620 WARN L460 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-08 14:38:30,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:38:31,401 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 14:38:31,401 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 14:38:31,401 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L878 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-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L885 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-08 14:38:31,402 INFO L878 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-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 14:38:31,403 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:38:31,403 INFO L878 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-08 14:38:31,403 INFO L878 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-08 14:38:31,403 INFO L878 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-08 14:38:31,403 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:38:31,405 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2, 2] [2022-04-08 14:38:31,406 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:38:31,408 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:38:31,410 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:38:31,418 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-08 14:38:31,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:38:31 BoogieIcfgContainer [2022-04-08 14:38:31,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:38:31,429 INFO L158 Benchmark]: Toolchain (without parser) took 54391.68ms. Allocated memory was 165.7MB in the beginning and 329.3MB in the end (delta: 163.6MB). Free memory was 116.3MB in the beginning and 145.0MB in the end (delta: -28.7MB). Peak memory consumption was 136.2MB. Max. memory is 8.0GB. [2022-04-08 14:38:31,430 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 132.3MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:38:31,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.93ms. Allocated memory is still 165.7MB. Free memory was 116.1MB in the beginning and 141.1MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:38:31,430 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 139.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:38:31,430 INFO L158 Benchmark]: RCFGBuilder took 263.11ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 128.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:38:31,431 INFO L158 Benchmark]: TraceAbstraction took 53907.57ms. Allocated memory was 165.7MB in the beginning and 329.3MB in the end (delta: 163.6MB). Free memory was 127.9MB in the beginning and 145.0MB in the end (delta: -17.2MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-04-08 14:38:31,431 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 132.3MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.93ms. Allocated memory is still 165.7MB. Free memory was 116.1MB in the beginning and 141.1MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 139.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 263.11ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 128.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 53907.57ms. Allocated memory was 165.7MB in the beginning and 329.3MB in the end (delta: 163.6MB). Free memory was 127.9MB in the beginning and 145.0MB in the end (delta: -17.2MB). Peak memory consumption was 148.0MB. 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: 53.8s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 296 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 661 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 223 PreInvPairs, 338 NumberOfFragments, 249 HoareAnnotationTreeSize, 223 FomulaSimplifications, 556 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1534 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-08 14:38:31,459 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...