/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:41:37,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:41:37,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:41:37,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:41:37,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:41:37,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:41:37,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:41:37,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:41:37,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:41:37,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:41:37,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:41:37,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:41:37,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:41:37,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:41:37,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:41:37,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:41:37,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:41:37,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:41:37,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:41:37,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:41:37,376 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:41:37,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:41:37,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:41:37,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:41:37,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:41:37,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:41:37,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:41:37,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:41:37,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:41:37,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:41:37,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:41:37,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:41:37,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:41:37,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:41:37,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:41:37,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:41:37,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:41:37,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:41:37,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:41:37,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:41:37,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:41:37,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:41:37,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:41:37,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:41:37,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:41:37,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:41:37,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:41:37,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:41:37,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:41:37,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:41:37,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:41:37,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:41:37,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:41:37,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:41:37,407 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:41:37,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:41:37,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:41:37,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:41:37,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:41:37,638 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:41:37,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-04-28 14:41:37,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30a249eb/00219e1b01c84e0a9d4b1a7d24f403ab/FLAGfa92584ae [2022-04-28 14:41:38,034 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:41:38,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-04-28 14:41:38,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30a249eb/00219e1b01c84e0a9d4b1a7d24f403ab/FLAGfa92584ae [2022-04-28 14:41:38,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30a249eb/00219e1b01c84e0a9d4b1a7d24f403ab [2022-04-28 14:41:38,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:41:38,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:41:38,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:41:38,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:41:38,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:41:38,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed5dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38, skipping insertion in model container [2022-04-28 14:41:38,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:41:38,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:41:38,185 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_valuebound5.c[520,533] [2022-04-28 14:41:38,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:41:38,214 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:41:38,226 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_valuebound5.c[520,533] [2022-04-28 14:41:38,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:41:38,255 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:41:38,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38 WrapperNode [2022-04-28 14:41:38,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:41:38,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:41:38,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:41:38,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:41:38,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:41:38,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:41:38,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:41:38,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:41:38,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 14:41:38,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:41:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:38,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:41:38,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:41:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:41:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:41:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:41:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:41:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:41:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:41:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:41:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:41:38,396 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:41:38,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:41:38,534 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:41:38,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:41:38,539 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:41:38,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:38 BoogieIcfgContainer [2022-04-28 14:41:38,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:41:38,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:41:38,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:41:38,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:41:38,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:38" (1/3) ... [2022-04-28 14:41:38,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40889ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:38, skipping insertion in model container [2022-04-28 14:41:38,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (2/3) ... [2022-04-28 14:41:38,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40889ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:38, skipping insertion in model container [2022-04-28 14:41:38,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:38" (3/3) ... [2022-04-28 14:41:38,548 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound5.c [2022-04-28 14:41:38,557 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:41:38,558 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:41:38,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:41:38,595 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@325c93d7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77a57838 [2022-04-28 14:41:38,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:41:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:41:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:41:38,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:38,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:38,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:38,624 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 14:41:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:38,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969013282] [2022-04-28 14:41:38,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 14:41:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:38,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313814784] [2022-04-28 14:41:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:41:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:38,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:41:38,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:41:38,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:41:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:41:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:38,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:41:38,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:41:38,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:41:38,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:41:38,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:41:38,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:41:38,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:41:38,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:41:38,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 14:41:38,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-28 14:41:38,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-28 14:41:38,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:41:38,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:41:38,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:41:38,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:41:38,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 14:41:38,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 14:41:38,854 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-28 14:41:38,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 14:41:38,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 14:41:38,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 14:41:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:38,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313814784] [2022-04-28 14:41:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313814784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:38,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:38,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:41:38,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969013282] [2022-04-28 14:41:38,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969013282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:38,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:38,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:41:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072009201] [2022-04-28 14:41:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:38,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:38,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:38,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:38,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:38,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:41:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:41:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:41:38,926 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,088 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 14:41:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:41:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:41:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:41:39,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 14:41:39,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:39,202 INFO L225 Difference]: With dead ends: 53 [2022-04-28 14:41:39,202 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:41:39,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:41:39,209 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:39,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:41:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:41:39,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:39,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:39,243 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:39,243 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,251 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:41:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:39,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:39,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:39,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:41:39,253 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:41:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,256 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:41:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:39,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:39,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:39,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:39,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 14:41:39,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 14:41:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:39,271 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 14:41:39,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 14:41:39,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:41:39,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:39,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:39,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:41:39,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 14:41:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:39,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195040385] [2022-04-28 14:41:39,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 14:41:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:39,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400556837] [2022-04-28 14:41:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:41:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:39,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:41:39,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:39,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:41:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:41:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:39,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:41:39,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:41:39,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:39,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:41:39,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:41:39,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:41:39,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:39,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:41:39,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 14:41:39,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-28 14:41:39,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {256#true} is VALID [2022-04-28 14:41:39,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:41:39,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:41:39,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:39,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:41:39,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:41:39,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:41:39,474 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:39,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:39,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 14:41:39,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 14:41:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:39,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400556837] [2022-04-28 14:41:39,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400556837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:39,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:39,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:39,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:39,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195040385] [2022-04-28 14:41:39,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195040385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:39,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:39,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761727059] [2022-04-28 14:41:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:39,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:39,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:39,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:41:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:41:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:39,495 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,805 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:41:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:41:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:41:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:41:39,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 14:41:39,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:39,859 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:41:39,860 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:41:39,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:41:39,861 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:39,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:41:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 14:41:39,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:39,868 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:39,869 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,871 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:41:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:41:39,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:39,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:39,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:41:39,876 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:41:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:39,878 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:41:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:41:39,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:39,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:39,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:39,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 14:41:39,881 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 14:41:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:39,882 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 14:41:39,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:39,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 14:41:39,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 14:41:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:41:39,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:39,925 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:39,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:41:39,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 14:41:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:39,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625109603] [2022-04-28 14:41:39,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 14:41:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:39,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350817595] [2022-04-28 14:41:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:39,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438731479] [2022-04-28 14:41:39,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:39,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:39,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:39,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:41:39,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:39,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:39,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:41:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:40,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:40,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 14:41:40,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-28 14:41:40,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:40,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 14:41:40,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 14:41:40,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-28 14:41:40,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {507#true} is VALID [2022-04-28 14:41:40,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:41:40,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:41:40,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:40,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 14:41:40,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,133 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-28 14:41:40,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:41:40,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:41:40,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:40,134 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:40,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:40,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 14:41:40,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 14:41:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:40,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:41:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:40,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350817595] [2022-04-28 14:41:40,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:40,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438731479] [2022-04-28 14:41:40,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438731479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:40,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:40,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:40,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625109603] [2022-04-28 14:41:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625109603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:40,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:40,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390960319] [2022-04-28 14:41:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:41:40,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:40,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:40,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:40,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:41:40,158 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:40,303 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:41:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:41:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:40,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:41:40,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:40,352 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:41:40,352 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 14:41:40,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:40,357 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:40,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 14:41:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 14:41:40,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:40,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:40,386 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:40,387 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:40,389 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:41:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:41:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:40,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:40,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:41:40,394 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:41:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:40,396 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:41:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:41:40,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:40,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:40,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:40,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 14:41:40,403 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 14:41:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:40,403 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 14:41:40,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:40,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 14:41:40,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 14:41:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:41:40,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:40,454 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:40,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:40,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:40,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 14:41:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:40,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371850945] [2022-04-28 14:41:40,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 14:41:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:40,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984122711] [2022-04-28 14:41:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:40,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:40,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564360897] [2022-04-28 14:41:40,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:40,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:40,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:40,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:41:40,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:40,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:40,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:41:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:40,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:40,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 14:41:40,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-28 14:41:40,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:40,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 14:41:40,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 14:41:40,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-28 14:41:40,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:40,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:40,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:40,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:40,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 14:41:40,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,832 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:40,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:40,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:40,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:40,834 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,834 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:40,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:40,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:40,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:40,836 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:40,837 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:40,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:40,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 14:41:40,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 14:41:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:41:40,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:41:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984122711] [2022-04-28 14:41:40,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564360897] [2022-04-28 14:41:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564360897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:40,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:40,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:40,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371850945] [2022-04-28 14:41:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371850945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:40,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:40,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862872991] [2022-04-28 14:41:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:41:40,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:40,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:40,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:40,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:40,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:41:40,858 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:40,999 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 14:41:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:41,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:41:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:41,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:41:41,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:41,041 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:41:41,042 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:41:41,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:41,043 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:41,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:41:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:41:41,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:41,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:41,062 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:41,063 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:41,066 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:41:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:41,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:41,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:41,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:41:41,081 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:41:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:41,083 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:41:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:41,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:41,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:41,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 14:41:41,086 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 14:41:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:41,087 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 14:41:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:41,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 14:41:41,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:41:41,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:41,128 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:41,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:41,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 14:41:41,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 14:41:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238590485] [2022-04-28 14:41:41,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:41,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-28 14:41:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:41,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526048984] [2022-04-28 14:41:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:41,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:41,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581589290] [2022-04-28 14:41:41,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:41,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:41,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:41:41,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:41,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:41,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:41:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:41,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:41,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:41:41,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:41:41,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:41:41,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:41:41,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:41,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:41,740 INFO L272 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,741 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:41,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,742 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:41,742 INFO L272 TraceCheckUtils]: 23: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,750 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:41,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:41:41,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:41:41,752 INFO L272 TraceCheckUtils]: 30: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:41,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:41,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:41:41,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:41:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:41:41,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:41,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:41:41,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:41:41,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:41,887 INFO L272 TraceCheckUtils]: 30: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:41,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,888 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,889 INFO L272 TraceCheckUtils]: 23: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,889 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,890 INFO L272 TraceCheckUtils]: 18: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,890 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,891 INFO L272 TraceCheckUtils]: 13: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:41,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:41,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:41:41,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:41:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:41:41,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526048984] [2022-04-28 14:41:41,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581589290] [2022-04-28 14:41:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581589290] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:41:41,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:41:41,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:41:41,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:41,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238590485] [2022-04-28 14:41:41,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238590485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:41,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:41,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420135015] [2022-04-28 14:41:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:41:41,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:41,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:41,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:41:41,920 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:42,042 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-28 14:41:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:41:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:42,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:41:42,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:42,078 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:41:42,078 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:41:42,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:42,079 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:42,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:41:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:41:42,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:42,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:42,099 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:42,100 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:42,101 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:41:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:42,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:42,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:42,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:41:42,102 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:41:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:42,103 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:41:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:42,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:42,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:42,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 14:41:42,105 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-28 14:41:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:42,105 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 14:41:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:42,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 14:41:42,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:41:42,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:42,154 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:42,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:42,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:42,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-28 14:41:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:42,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912027465] [2022-04-28 14:41:42,515 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:42,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-28 14:41:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:42,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421344593] [2022-04-28 14:41:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:42,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:42,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829592555] [2022-04-28 14:41:42,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:41:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:42,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:42,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:41:42,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:41:42,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:42,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:41:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:42,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:42,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:41:42,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:42,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:42,731 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:42,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,734 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:42,734 INFO L272 TraceCheckUtils]: 23: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,734 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:42,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:42,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} assume !false; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:42,735 INFO L272 TraceCheckUtils]: 30: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,739 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1776#(and (= main_~a~0 1) (= main_~s~0 4))} #57#return; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:42,740 INFO L272 TraceCheckUtils]: 35: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:42,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:42,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:41:42,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:41:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:41:42,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:42,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:41:42,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:41:42,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:42,888 INFO L272 TraceCheckUtils]: 35: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:42,889 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:42,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,889 INFO L272 TraceCheckUtils]: 30: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:42,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:42,921 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:42,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,921 INFO L272 TraceCheckUtils]: 23: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,922 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:42,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,922 INFO L272 TraceCheckUtils]: 18: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,927 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:42,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,928 INFO L272 TraceCheckUtils]: 13: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:42,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:42,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:41:42,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:42,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:41:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:41:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421344593] [2022-04-28 14:41:42,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829592555] [2022-04-28 14:41:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829592555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:42,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 14:41:42,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912027465] [2022-04-28 14:41:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912027465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:42,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603723507] [2022-04-28 14:41:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:41:42,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:42,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:42,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:42,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:41:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:41:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:42,952 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:43,191 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 14:41:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:41:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:41:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:41:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:41:43,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 14:41:43,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:43,241 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:41:43,241 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:41:43,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:41:43,242 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:43,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:41:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 14:41:43,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:43,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:43,264 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:43,264 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:43,266 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:41:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:41:43,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:43,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:43,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:41:43,266 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:41:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:43,268 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:41:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:41:43,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:43,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:43,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:43,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 14:41:43,270 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-28 14:41:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 14:41:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:43,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 14:41:43,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:41:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:41:43,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:43,334 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:43,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:43,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:43,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-28 14:41:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831954330] [2022-04-28 14:41:43,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:43,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-28 14:41:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:43,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462049863] [2022-04-28 14:41:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:43,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:43,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347816430] [2022-04-28 14:41:43,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:41:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:43,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:43,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:41:43,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:41:43,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:43,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:41:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:43,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:43,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:41:43,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:41:43,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:41:43,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:41:43,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:41:43,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:43,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:41:43,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:43,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:43,929 INFO L272 TraceCheckUtils]: 13: Hoare triple {2323#(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)); {2285#true} is VALID [2022-04-28 14:41:43,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,930 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:43,930 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(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)); {2285#true} is VALID [2022-04-28 14:41:43,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,931 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:43,931 INFO L272 TraceCheckUtils]: 23: Hoare triple {2323#(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)); {2285#true} is VALID [2022-04-28 14:41:43,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,931 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:43,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {2323#(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; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:43,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} assume !false; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:43,932 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:43,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,933 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #57#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:43,933 INFO L272 TraceCheckUtils]: 35: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:43,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:43,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:43,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:43,934 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #59#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:43,934 INFO L272 TraceCheckUtils]: 40: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:43,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:43,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:41:43,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:41:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:41:43,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:44,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:41:44,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:41:44,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:44,084 INFO L272 TraceCheckUtils]: 40: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:44,085 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,085 INFO L272 TraceCheckUtils]: 35: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,086 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,086 INFO L272 TraceCheckUtils]: 30: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,089 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #61#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,089 INFO L272 TraceCheckUtils]: 23: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,090 INFO L272 TraceCheckUtils]: 18: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,090 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,091 INFO L272 TraceCheckUtils]: 13: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:44,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:41:44,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:44,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:44,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:44,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:41:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 14:41:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:44,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462049863] [2022-04-28 14:41:44,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:44,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347816430] [2022-04-28 14:41:44,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347816430] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:41:44,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:41:44,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:41:44,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:44,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831954330] [2022-04-28 14:41:44,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831954330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:44,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:44,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767700546] [2022-04-28 14:41:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:44,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:41:44,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:44,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:44,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:44,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:41:44,143 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:44,278 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 14:41:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:41:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:44,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:41:44,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:44,309 INFO L225 Difference]: With dead ends: 64 [2022-04-28 14:41:44,309 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:41:44,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:44,310 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:44,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:41:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 14:41:44,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:44,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:44,336 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:44,336 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:44,338 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:41:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:44,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:44,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:44,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:41:44,338 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:41:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:44,340 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:41:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:44,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:44,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:44,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:44,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 14:41:44,342 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-28 14:41:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:44,342 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 14:41:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:44,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 14:41:44,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 14:41:44,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:44,403 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:44,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:44,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:44,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-28 14:41:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:44,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1903759608] [2022-04-28 14:41:44,784 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:44,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-28 14:41:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:44,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624204245] [2022-04-28 14:41:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:44,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943161794] [2022-04-28 14:41:44,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:44,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:44,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:44,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:41:44,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:44,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:44,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:41:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:44,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:45,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:41:45,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:41:45,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:45,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:45,033 INFO L272 TraceCheckUtils]: 13: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,034 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:45,034 INFO L272 TraceCheckUtils]: 18: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,034 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:45,034 INFO L272 TraceCheckUtils]: 23: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,035 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:45,036 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 (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:41:45,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !false; {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:41:45,036 INFO L272 TraceCheckUtils]: 30: Hoare triple {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #57#return; {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:41:45,037 INFO L272 TraceCheckUtils]: 35: Hoare triple {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #59#return; {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:41:45,037 INFO L272 TraceCheckUtils]: 40: Hoare triple {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,040 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #61#return; {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:41:45,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {3011#(and (= (+ (- 1) main_~a~0) 0) (= (+ 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))) (= main_~a~0 2))} is VALID [2022-04-28 14:41:45,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} assume !false; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} is VALID [2022-04-28 14:41:45,045 INFO L272 TraceCheckUtils]: 47: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,048 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} #57#return; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} is VALID [2022-04-28 14:41:45,049 INFO L272 TraceCheckUtils]: 52: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= main_~a~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:45,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:45,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:41:45,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:41:45,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:45,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:45,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:41:45,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:45,249 INFO L272 TraceCheckUtils]: 52: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:45,250 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:45,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,250 INFO L272 TraceCheckUtils]: 47: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:45,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:45,261 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L272 TraceCheckUtils]: 40: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,262 INFO L272 TraceCheckUtils]: 35: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,263 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:45,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,263 INFO L272 TraceCheckUtils]: 30: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:45,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:45,266 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L272 TraceCheckUtils]: 23: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,267 INFO L272 TraceCheckUtils]: 18: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,267 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:45,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,267 INFO L272 TraceCheckUtils]: 13: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:45,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:41:45,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:41:45,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:45,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:41:45,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:41:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:41:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624204245] [2022-04-28 14:41:45,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943161794] [2022-04-28 14:41:45,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943161794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:45,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:45,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 14:41:45,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1903759608] [2022-04-28 14:41:45,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1903759608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:45,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:45,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:41:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152131234] [2022-04-28 14:41:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:45,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:41:45,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:45,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:45,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:45,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:41:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:45,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:41:45,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:41:45,294 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:45,634 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-04-28 14:41:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:41:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:41:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:41:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:41:45,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 14:41:45,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:45,683 INFO L225 Difference]: With dead ends: 80 [2022-04-28 14:41:45,683 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:41:45,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:41:45,684 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:45,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:41:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:41:45,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:45,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:45,727 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:45,727 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:45,729 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:41:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:41:45,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:45,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:45,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:41:45,730 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:41:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:45,732 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:41:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:41:45,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:45,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:45,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:45,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-28 14:41:45,734 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 56 [2022-04-28 14:41:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:45,735 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-28 14:41:45,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:45,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-28 14:41:45,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:41:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 14:41:45,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:45,819 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:45,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:46,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:46,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 9 times [2022-04-28 14:41:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:46,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344711390] [2022-04-28 14:41:46,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:46,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 10 times [2022-04-28 14:41:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:46,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981742878] [2022-04-28 14:41:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:46,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786434403] [2022-04-28 14:41:46,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:41:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:46,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:46,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:41:46,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:41:46,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:46,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:41:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:46,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:46,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:41:46,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3758#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:41:46,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {3758#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3762#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:46,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {3762#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3762#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:46,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3762#(not (= |assume_abort_if_not_#in~cond| 0))} {3732#true} #55#return; {3769#(and (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(and (<= main_~n~0 5) (<= 0 main_~n~0))} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} assume !false; {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,671 INFO L272 TraceCheckUtils]: 13: Hoare triple {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} #57#return; {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,672 INFO L272 TraceCheckUtils]: 18: Hoare triple {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,673 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} #59#return; {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,673 INFO L272 TraceCheckUtils]: 23: Hoare triple {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,674 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} #61#return; {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {3773#(and (<= 1 main_~s~0) (<= main_~n~0 5) (<= 1 main_~t~0) (<= 0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} is VALID [2022-04-28 14:41:46,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} assume !false; {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} is VALID [2022-04-28 14:41:46,675 INFO L272 TraceCheckUtils]: 30: Hoare triple {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} #57#return; {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} is VALID [2022-04-28 14:41:46,676 INFO L272 TraceCheckUtils]: 35: Hoare triple {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} #59#return; {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} is VALID [2022-04-28 14:41:46,676 INFO L272 TraceCheckUtils]: 40: Hoare triple {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,677 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} #61#return; {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} is VALID [2022-04-28 14:41:46,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {3825#(and (<= main_~n~0 5) (<= (+ main_~t~0 1) main_~s~0) (<= 0 main_~n~0) (<= 3 main_~t~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} assume !false; {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,678 INFO L272 TraceCheckUtils]: 47: Hoare triple {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,679 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} #57#return; {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,679 INFO L272 TraceCheckUtils]: 52: Hoare triple {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,679 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,680 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} #59#return; {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,680 INFO L272 TraceCheckUtils]: 57: Hoare triple {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:46,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:46,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:46,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:46,680 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} #61#return; {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {3877#(and (<= 9 main_~s~0) (<= main_~n~0 5) (<= 0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L272 TraceCheckUtils]: 64: Hoare triple {3733#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {3733#false} ~cond := #in~cond; {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {3733#false} assume !(0 == ~cond); {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {3733#false} assume true; {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3733#false} {3733#false} #57#return; {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L272 TraceCheckUtils]: 69: Hoare triple {3733#false} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3733#false} is VALID [2022-04-28 14:41:46,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {3733#false} ~cond := #in~cond; {3733#false} is VALID [2022-04-28 14:41:46,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {3733#false} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:41:46,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:41:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 68 proven. 10 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-04-28 14:41:46,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:47,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:41:47,310 INFO L290 TraceCheckUtils]: 71: Hoare triple {3733#false} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {3733#false} ~cond := #in~cond; {3733#false} is VALID [2022-04-28 14:41:47,311 INFO L272 TraceCheckUtils]: 69: Hoare triple {3733#false} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3733#false} is VALID [2022-04-28 14:41:47,311 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3733#false} #57#return; {3733#false} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,311 INFO L272 TraceCheckUtils]: 64: Hoare triple {3733#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:41:47,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {3989#(not (<= main_~s~0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3733#false} is VALID [2022-04-28 14:41:47,312 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3989#(not (<= main_~s~0 main_~n~0))} #61#return; {3989#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:47,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,312 INFO L272 TraceCheckUtils]: 57: Hoare triple {3989#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,313 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3989#(not (<= main_~s~0 main_~n~0))} #59#return; {3989#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:47,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,313 INFO L272 TraceCheckUtils]: 52: Hoare triple {3989#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,314 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3989#(not (<= main_~s~0 main_~n~0))} #57#return; {3989#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:47,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,314 INFO L272 TraceCheckUtils]: 47: Hoare triple {3989#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {3989#(not (<= main_~s~0 main_~n~0))} assume !false; {3989#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:47,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {4041#(< main_~n~0 (+ 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; {3989#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:47,316 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #61#return; {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:47,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,316 INFO L272 TraceCheckUtils]: 40: Hoare triple {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,316 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #59#return; {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:47,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L272 TraceCheckUtils]: 35: Hoare triple {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #57#return; {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:47,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,317 INFO L272 TraceCheckUtils]: 30: Hoare triple {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} assume !false; {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:47,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {4093#(< main_~n~0 (+ 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; {4041#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:47,319 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:47,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,319 INFO L272 TraceCheckUtils]: 23: Hoare triple {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:47,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L272 TraceCheckUtils]: 18: Hoare triple {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:47,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:41:47,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:41:47,321 INFO L272 TraceCheckUtils]: 13: Hoare triple {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:47,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {4145#(< (div (+ 6 (* (- 1) main_~n~0)) (- 2)) 2)} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4093#(< main_~n~0 (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:41:47,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3762#(not (= |assume_abort_if_not_#in~cond| 0))} {3732#true} #55#return; {4145#(< (div (+ 6 (* (- 1) main_~n~0)) (- 2)) 2)} is VALID [2022-04-28 14:41:47,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {3762#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3762#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:47,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {4158#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3762#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:47,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {4158#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:41:47,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:41:47,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:41:47,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:41:47,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:41:47,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:41:47,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:41:47,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:41:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 14:41:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981742878] [2022-04-28 14:41:47,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786434403] [2022-04-28 14:41:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786434403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:47,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-28 14:41:47,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:47,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344711390] [2022-04-28 14:41:47,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344711390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:47,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:47,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:41:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411642555] [2022-04-28 14:41:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-28 14:41:47,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:47,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:41:47,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:47,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:41:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:47,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:41:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:41:47,362 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:41:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:47,659 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:41:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:41:47,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-28 14:41:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:41:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 14:41:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:41:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 14:41:47,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 14:41:47,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:47,710 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:41:47,710 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:41:47,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:41:47,711 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:47,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:41:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:41:47,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:47,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:47,712 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:47,712 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:47,713 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:47,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:47,713 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:47,713 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:47,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:47,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:41:47,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-04-28 14:41:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:47,714 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:41:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 14:41:47,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:41:47,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:47,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:47,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:41:47,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:47,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:47,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:41:48,899 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:41:48,899 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:41:48,899 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:41:48,899 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (let ((.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (<= main_~n~0 5)) (.cse1 (<= 0 main_~n~0)) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 3 main_~t~0) .cse3 (= main_~s~0 9)) (and .cse0 .cse1 .cse3 (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3)))) [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (<= main_~n~0 5)) (.cse1 (<= 0 main_~n~0)) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 3 main_~t~0) .cse3 (= main_~s~0 9)) (and .cse0 .cse1 .cse3 (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3)))) [2022-04-28 14:41:48,899 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (<= main_~n~0 5)) (.cse1 (<= 0 main_~n~0)) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 3 main_~t~0) .cse3 (= main_~s~0 9)) (and .cse0 .cse1 .cse3 (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3)))) [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse1 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~a~0 1) .cse0 .cse1) (and (= main_~a~0 2) .cse0 .cse1))) [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (let ((.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (<= main_~n~0 5)) (.cse1 (<= 0 main_~n~0)) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 3 main_~t~0) .cse3 (= main_~s~0 9)) (and .cse0 .cse1 .cse3 (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3)))) [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (let ((.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (<= main_~n~0 5)) (.cse1 (<= 0 main_~n~0)) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 3 main_~t~0) .cse3 (= main_~s~0 9)) (and .cse0 .cse1 .cse3 (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3)))) [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse0 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) (= main_~s~0 1) .cse0) (and (= main_~a~0 1) .cse1 .cse0) (and (= main_~a~0 2) .cse1 .cse0))) [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= main_~n~0 5) (<= 0 main_~n~0)) [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1)))) [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,900 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,901 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:48,901 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:41:48,901 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:48,901 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:48,901 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:48,901 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:48,901 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:48,903 INFO L356 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 2] [2022-04-28 14:41:48,904 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:41:48,906 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:41:48,917 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:41:48,933 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:41:48,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:48 BoogieIcfgContainer [2022-04-28 14:41:48,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:41:48,949 INFO L158 Benchmark]: Toolchain (without parser) took 10899.32ms. Allocated memory was 180.4MB in the beginning and 294.6MB in the end (delta: 114.3MB). Free memory was 131.1MB in the beginning and 140.2MB in the end (delta: -9.1MB). Peak memory consumption was 105.9MB. Max. memory is 8.0GB. [2022-04-28 14:41:48,949 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:41:48,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.46ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 156.3MB in the end (delta: -25.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:48,950 INFO L158 Benchmark]: Boogie Preprocessor took 39.15ms. Allocated memory is still 180.4MB. Free memory was 156.3MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:41:48,950 INFO L158 Benchmark]: RCFGBuilder took 246.62ms. Allocated memory is still 180.4MB. Free memory was 154.7MB in the beginning and 143.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:48,950 INFO L158 Benchmark]: TraceAbstraction took 10404.59ms. Allocated memory was 180.4MB in the beginning and 294.6MB in the end (delta: 114.3MB). Free memory was 143.1MB in the beginning and 140.2MB in the end (delta: 2.9MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2022-04-28 14:41:48,954 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.12ms. Allocated memory is still 180.4MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.46ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 156.3MB in the end (delta: -25.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.15ms. Allocated memory is still 180.4MB. Free memory was 156.3MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.62ms. Allocated memory is still 180.4MB. Free memory was 154.7MB in the beginning and 143.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10404.59ms. Allocated memory was 180.4MB in the beginning and 294.6MB in the end (delta: 114.3MB). Free memory was 143.1MB in the beginning and 140.2MB in the end (delta: 2.9MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 10.3s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 820 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 277 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 499 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 193 PreInvPairs, 270 NumberOfFragments, 669 HoareAnnotationTreeSize, 193 FomulaSimplifications, 278 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 31 FomulaSimplificationsInter, 354 FormulaSimplificationTreeSizeReductionInter, 0.8s 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 == 1 && n <= 5) && 0 <= n) && t * 2 + t * t + 1 == s * 4) && t == a * 2 + 1) || (((((n <= 5 && 0 <= n) && t * 2 + t * t + 1 == s * 4) && 3 <= t) && t == a * 2 + 1) && s == 9)) || ((((n <= 5 && 0 <= n) && t == a * 2 + 1) && s == t + 1) && t == 3) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - 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: (!(1 <= \old(cond)) || 1 <= cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:41:48,973 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...