/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:40:29,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:40:29,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:40:29,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:40:29,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:40:29,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:40:29,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:40:29,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:40:29,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:40:29,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:40:29,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:40:29,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:40:29,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:40:29,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:40:29,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:40:29,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:40:29,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:40:29,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:40:29,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:40:29,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:40:29,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:40:29,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:40:29,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:40:29,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:40:29,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:40:29,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:40:29,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:40:29,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:40:29,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:40:29,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:40:29,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:40:29,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:40:29,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:40:29,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:40:29,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:40:29,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:40:29,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:40:29,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:40:29,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:40:29,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:40:29,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:40:29,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:40:29,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:40:29,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:40:29,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:40:29,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:40:29,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:40:29,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:40:29,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:40:29,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:40:29,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:40:29,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:40:29,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:40:29,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:40:29,586 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:40:29,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:40:29,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:40:29,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:40:29,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:40:29,795 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:40:29,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-28 14:40:29,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc68e44/88f65ad7bfe44a49970a41cef10a7d9a/FLAG2da6e976d [2022-04-28 14:40:30,186 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:40:30,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c [2022-04-28 14:40:30,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc68e44/88f65ad7bfe44a49970a41cef10a7d9a/FLAG2da6e976d [2022-04-28 14:40:30,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc68e44/88f65ad7bfe44a49970a41cef10a7d9a [2022-04-28 14:40:30,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:40:30,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:40:30,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:40:30,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:40:30,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:40:30,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75057d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30, skipping insertion in model container [2022-04-28 14:40:30,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:40:30,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:40:30,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c[520,533] [2022-04-28 14:40:30,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:40:30,336 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:40:30,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound10.c[520,533] [2022-04-28 14:40:30,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:40:30,366 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:40:30,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30 WrapperNode [2022-04-28 14:40:30,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:40:30,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:40:30,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:40:30,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:40:30,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:40:30,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:40:30,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:40:30,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:40:30,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (1/1) ... [2022-04-28 14:40:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:40:30,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:30,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:40:30,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:40:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:40:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:40:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:40:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:40:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:40:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:40:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:40:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:40:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:40:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:40:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:40:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:40:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:40:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:40:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:40:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:40:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:40:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:40:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:40:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:40:30,488 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:40:30,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:40:30,579 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:40:30,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:40:30,590 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:40:30,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:40:30 BoogieIcfgContainer [2022-04-28 14:40:30,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:40:30,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:40:30,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:40:30,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:40:30,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:40:30" (1/3) ... [2022-04-28 14:40:30,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6de73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:40:30, skipping insertion in model container [2022-04-28 14:40:30,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:40:30" (2/3) ... [2022-04-28 14:40:30,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6de73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:40:30, skipping insertion in model container [2022-04-28 14:40:30,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:40:30" (3/3) ... [2022-04-28 14:40:30,610 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound10.c [2022-04-28 14:40:30,619 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:40:30,619 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:40:30,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:40:30,655 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@3d698078, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@515e58c [2022-04-28 14:40:30,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:40:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:40:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:40:30,686 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:30,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:30,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 14:40:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684256352] [2022-04-28 14:40:30,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 14:40:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:30,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529179291] [2022-04-28 14:40:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:40:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:30,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:40:30,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:40:30,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:40:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:40:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:30,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:40:30,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:40:30,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:40:30,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:40:30,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:40:30,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:40:30,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:40:30,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:40:30,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 14:40:30,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-28 14:40:30,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-28 14:40:30,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:40:30,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:40:30,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:40:30,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:40:30,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 14:40:30,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 14:40:30,853 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-28 14:40:30,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 14:40:30,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 14:40:30,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 14:40:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529179291] [2022-04-28 14:40:30,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529179291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:30,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:30,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:40:30,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:30,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684256352] [2022-04-28 14:40:30,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684256352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:30,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:30,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:40:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52492440] [2022-04-28 14:40:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:30,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:30,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:30,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:30,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:40:30,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:40:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:40:30,909 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,072 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 14:40:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:40:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:40:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:40:31,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 14:40:31,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:31,184 INFO L225 Difference]: With dead ends: 53 [2022-04-28 14:40:31,184 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:40:31,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:40:31,192 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:31,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:40:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:40:31,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:31,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:31,219 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:31,219 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,230 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:40:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:31,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:31,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:31,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:40:31,231 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:40:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,233 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:40:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:31,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:31,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:31,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:31,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:40:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 14:40:31,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 14:40:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:31,240 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 14:40:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 14:40:31,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:40:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:40:31,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:31,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:40:31,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 14:40:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577808657] [2022-04-28 14:40:31,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 14:40:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:31,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543240689] [2022-04-28 14:40:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:31,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:40:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:31,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:40:31,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:31,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:40:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:40:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:31,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:40:31,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:40:31,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:31,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:40:31,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:40:31,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:40:31,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:31,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:40:31,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 14:40:31,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-28 14:40:31,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {256#true} is VALID [2022-04-28 14:40:31,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:40:31,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:40:31,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:40:31,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:40:31,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:40:31,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:40:31,428 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:31,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:40:31,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 14:40:31,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 14:40:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543240689] [2022-04-28 14:40:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543240689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:31,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:31,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:31,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:31,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577808657] [2022-04-28 14:40:31,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577808657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:31,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:31,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193821153] [2022-04-28 14:40:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:31,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:31,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:31,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:31,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:40:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:31,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:40:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:31,444 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,777 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:40:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:40:31,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:40:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:40:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:40:31,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 14:40:31,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:31,830 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:40:31,830 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:40:31,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:40:31,831 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:40:31,831 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:40:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:40:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 14:40:31,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:31,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:31,838 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:31,839 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,841 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:40:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:40:31,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:31,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:31,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:40:31,842 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:40:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:31,845 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:40:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:40:31,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:31,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:31,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:31,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:40:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 14:40:31,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 14:40:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:31,848 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 14:40:31,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:40:31,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 14:40:31,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 14:40:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:40:31,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:31,891 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:31,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:40:31,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 14:40:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:31,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693139615] [2022-04-28 14:40:31,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 14:40:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:31,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585040151] [2022-04-28 14:40:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:31,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:31,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382459509] [2022-04-28 14:40:31,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:31,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:31,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:31,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:40:31,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:31,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:31,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:40:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:31,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:32,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 14:40:32,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-28 14:40:32,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:32,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 14:40:32,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 14:40:32,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-28 14:40:32,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {507#true} is VALID [2022-04-28 14:40:32,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:40:32,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:40:32,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:32,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 14:40:32,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,148 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-28 14:40:32,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:40:32,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:40:32,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:40:32,149 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,149 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:32,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:32,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 14:40:32,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 14:40:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:40:32,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:40:32,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:32,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585040151] [2022-04-28 14:40:32,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:32,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382459509] [2022-04-28 14:40:32,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382459509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:32,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:32,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:32,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:32,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693139615] [2022-04-28 14:40:32,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693139615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:32,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:32,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879845842] [2022-04-28 14:40:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:40:32,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:32,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:32,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:32,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:40:32,172 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:32,314 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:40:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:40:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:32,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:40:32,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:32,367 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:40:32,367 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 14:40:32,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:32,368 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:32,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 14:40:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 14:40:32,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:32,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:32,383 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:32,383 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:32,385 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:40:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:40:32,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:32,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:32,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:40:32,386 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:40:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:32,388 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:40:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:40:32,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:32,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:32,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:32,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 14:40:32,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 14:40:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:32,392 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 14:40:32,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:40:32,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 14:40:32,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 14:40:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:40:32,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:32,458 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:32,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:40:32,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:32,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 14:40:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:32,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389407359] [2022-04-28 14:40:32,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:40:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 14:40:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:32,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217322456] [2022-04-28 14:40:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:32,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105755690] [2022-04-28 14:40:32,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:32,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:32,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:32,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:32,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:40:32,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:32,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:32,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:40:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:32,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:32,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 14:40:32,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-28 14:40:32,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:32,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 14:40:32,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 14:40:32,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-28 14:40:32,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:32,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:32,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:32,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:32,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 14:40:32,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,815 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:32,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:32,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:32,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:32,816 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,816 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-28 14:40:32,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:40:32,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:40:32,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:40:32,817 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:32,818 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:32,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:32,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 14:40:32,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 14:40:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:40:32,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:40:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:32,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217322456] [2022-04-28 14:40:32,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:32,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105755690] [2022-04-28 14:40:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105755690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:32,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:32,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:32,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389407359] [2022-04-28 14:40:32,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389407359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:32,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:32,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954548028] [2022-04-28 14:40:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:40:32,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:32,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:32,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:32,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:32,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:40:32,840 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:32,983 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 14:40:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:40:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:40:32,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:40:33,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:33,022 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:40:33,022 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:40:33,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:40:33,023 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:33,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:40:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:40:33,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:33,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:33,035 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:33,035 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:33,037 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:40:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:33,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:33,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:33,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:40:33,038 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:40:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:33,039 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:40:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:33,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:33,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:33,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:33,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 14:40:33,041 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 14:40:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:33,042 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 14:40:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:40:33,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 14:40:33,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:40:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:40:33,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:33,082 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:33,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:33,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 14:40:33,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 14:40:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:33,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712505945] [2022-04-28 14:40:33,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:33,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-28 14:40:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275456382] [2022-04-28 14:40:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:33,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:33,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391944136] [2022-04-28 14:40:33,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:33,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:33,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:33,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:33,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:40:33,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:33,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:33,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:40:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:33,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:33,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:40:33,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:40:33,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:40:33,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:40:33,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:40:33,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:40:33,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:40:33,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:33,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,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:40:33,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:40:33,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,748 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:33,748 INFO L272 TraceCheckUtils]: 23: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,760 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:40:33,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:40:33,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:40:33,762 INFO L272 TraceCheckUtils]: 30: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:33,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:33,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:40:33,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:40:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:40:33,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:33,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:40:33,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:40:33,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:33,876 INFO L272 TraceCheckUtils]: 30: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:33,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,878 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,878 INFO L272 TraceCheckUtils]: 23: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,879 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,879 INFO L272 TraceCheckUtils]: 18: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,880 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,881 INFO L272 TraceCheckUtils]: 13: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:40:33,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:40:33,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:40:33,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:40:33,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:40:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:40:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:33,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275456382] [2022-04-28 14:40:33,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:33,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391944136] [2022-04-28 14:40:33,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391944136] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:40:33,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:40:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:40:33,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712505945] [2022-04-28 14:40:33,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712505945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:33,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:33,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321133400] [2022-04-28 14:40:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:40:33,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:33,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:33,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:33,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:40:33,900 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:34,017 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-28 14:40:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:40:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:34,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:40:34,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:34,044 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:40:34,044 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:40:34,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:34,045 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:34,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:40:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:40:34,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:34,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:34,064 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:34,064 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:34,065 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:40:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:34,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:34,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:34,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:40:34,066 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:40:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:34,067 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:40:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:34,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:34,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:34,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:34,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:40:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 14:40:34,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-28 14:40:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 14:40:34,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:34,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 14:40:34,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:40:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:40:34,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:34,118 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:34,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:34,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:34,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:34,320 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-28 14:40:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:34,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75274879] [2022-04-28 14:40:34,458 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:34,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-28 14:40:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:34,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16746192] [2022-04-28 14:40:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:34,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:34,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387979929] [2022-04-28 14:40:34,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:40:34,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:34,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:34,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:34,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:40:34,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:40:34,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:34,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:40:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:34,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:34,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:40:34,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:40:34,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:34,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:34,650 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,651 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:34,651 INFO L272 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,652 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:34,652 INFO L272 TraceCheckUtils]: 23: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,652 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:34,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:34,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} assume !false; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:34,653 INFO L272 TraceCheckUtils]: 30: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,657 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1776#(and (= main_~a~0 1) (= main_~s~0 4))} #57#return; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:40:34,658 INFO L272 TraceCheckUtils]: 35: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:34,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:34,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:40:34,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:40:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:40:34,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:34,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:40:34,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:40:34,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:34,789 INFO L272 TraceCheckUtils]: 35: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:34,790 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:34,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,790 INFO L272 TraceCheckUtils]: 30: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:34,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:34,812 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:34,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:34,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,813 INFO L272 TraceCheckUtils]: 18: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:34,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,814 INFO L272 TraceCheckUtils]: 13: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:34,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:40:34,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:40:34,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:40:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:40:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16746192] [2022-04-28 14:40:34,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387979929] [2022-04-28 14:40:34,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387979929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:34,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:34,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 14:40:34,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:34,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75274879] [2022-04-28 14:40:34,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75274879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:34,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:34,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:40:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141462365] [2022-04-28 14:40:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:40:34,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:34,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:34,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:40:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:40:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:34,843 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:35,076 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 14:40:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:40:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:40:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:40:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:40:35,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 14:40:35,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:35,125 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:40:35,125 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:40:35,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:40:35,126 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:35,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:40:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:40:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 14:40:35,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:35,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:35,149 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:35,150 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:40:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:40:35,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:35,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:35,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:40:35,151 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:40:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:35,153 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:40:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:40:35,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:35,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:35,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:35,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 14:40:35,155 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-28 14:40:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:35,155 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 14:40:35,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:40:35,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 14:40:35,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:40:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:40:35,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:35,214 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:35,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:35,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:35,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-28 14:40:35,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:35,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754431988] [2022-04-28 14:40:35,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:35,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-28 14:40:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:35,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074295322] [2022-04-28 14:40:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:35,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:35,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790361557] [2022-04-28 14:40:35,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:40:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:35,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:35,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:40:35,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:40:35,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:35,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:40:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:35,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:35,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:40:35,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:35,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:35,762 INFO L272 TraceCheckUtils]: 13: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,763 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:35,763 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,764 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:35,764 INFO L272 TraceCheckUtils]: 23: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,765 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:35,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:35,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} assume !false; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:35,765 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #57#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:35,766 INFO L272 TraceCheckUtils]: 35: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #59#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:40:35,767 INFO L272 TraceCheckUtils]: 40: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:35,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:35,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:40:35,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:40:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:40:35,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:35,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:40:35,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:40:35,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:35,907 INFO L272 TraceCheckUtils]: 40: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:35,908 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,908 INFO L272 TraceCheckUtils]: 35: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,909 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,909 INFO L272 TraceCheckUtils]: 30: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,911 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #61#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,912 INFO L272 TraceCheckUtils]: 23: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,912 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,913 INFO L272 TraceCheckUtils]: 18: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,913 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,914 INFO L272 TraceCheckUtils]: 13: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:35,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:40:35,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:40:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 14:40:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074295322] [2022-04-28 14:40:35,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790361557] [2022-04-28 14:40:35,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790361557] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:40:35,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:40:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:40:35,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754431988] [2022-04-28 14:40:35,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754431988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:35,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:40:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535634055] [2022-04-28 14:40:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:40:35,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:35,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:35,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:35,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:40:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:40:35,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:40:35,934 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:36,064 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 14:40:36,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:40:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:40:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:40:36,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:40:36,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:36,092 INFO L225 Difference]: With dead ends: 64 [2022-04-28 14:40:36,092 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:40:36,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:40:36,093 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:36,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:40:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:40:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 14:40:36,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:36,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:36,119 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:36,119 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:36,121 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:40:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:36,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:36,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:36,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:40:36,121 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:40:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:36,123 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:40:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:36,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:36,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:36,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:36,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:40:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 14:40:36,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-28 14:40:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:36,125 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 14:40:36,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:40:36,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 14:40:36,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:40:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 14:40:36,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:36,186 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:36,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:36,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-28 14:40:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:36,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178717819] [2022-04-28 14:40:36,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:36,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-28 14:40:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:36,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757295831] [2022-04-28 14:40:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:36,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823466270] [2022-04-28 14:40:36,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:40:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:36,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:36,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:36,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:40:36,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:40:36,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:36,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:40:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:36,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:36,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:40:36,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:36,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:36,816 INFO L272 TraceCheckUtils]: 13: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,817 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:36,817 INFO L272 TraceCheckUtils]: 18: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,817 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:36,818 INFO L272 TraceCheckUtils]: 23: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,818 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:40:36,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:36,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !false; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:36,819 INFO L272 TraceCheckUtils]: 30: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,820 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #57#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:36,820 INFO L272 TraceCheckUtils]: 35: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,821 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #59#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:36,821 INFO L272 TraceCheckUtils]: 40: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,822 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #61#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-28 14:40:36,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:36,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} assume !false; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:36,824 INFO L272 TraceCheckUtils]: 47: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:36,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:36,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:36,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:36,825 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} #57#return; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:36,825 INFO L272 TraceCheckUtils]: 52: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:36,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:36,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:40:36,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:40:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:40:36,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:37,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:40:37,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:40:37,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:37,053 INFO L272 TraceCheckUtils]: 52: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:37,053 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:37,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,054 INFO L272 TraceCheckUtils]: 47: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:37,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:37,057 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:37,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,057 INFO L272 TraceCheckUtils]: 40: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,058 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:37,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,059 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:37,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,059 INFO L272 TraceCheckUtils]: 30: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:37,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:37,061 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:37,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,062 INFO L272 TraceCheckUtils]: 23: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,067 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:37,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L272 TraceCheckUtils]: 18: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:37,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:37,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-28 14:40:37,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-28 14:40:37,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:40:37,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:40:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:40:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757295831] [2022-04-28 14:40:37,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823466270] [2022-04-28 14:40:37,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823466270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:37,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:37,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 14:40:37,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178717819] [2022-04-28 14:40:37,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178717819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:37,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:37,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:40:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971440605] [2022-04-28 14:40:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:37,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:40:37,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:37,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:37,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:37,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:40:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:37,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:40:37,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:40:37,103 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:37,433 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-04-28 14:40:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:40:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:40:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:40:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 14:40:37,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 14:40:37,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:37,475 INFO L225 Difference]: With dead ends: 80 [2022-04-28 14:40:37,475 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:40:37,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:40:37,476 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:37,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:40:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:40:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:40:37,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:37,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:37,518 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:37,518 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:37,520 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:40:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:37,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:37,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:37,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:40:37,521 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 14:40:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:37,523 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:40:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:37,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:37,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:37,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:37,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:40:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-28 14:40:37,525 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 56 [2022-04-28 14:40:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:37,525 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-28 14:40:37,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:40:37,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-28 14:40:37,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 14:40:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 14:40:37,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:37,605 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:37,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:37,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:37,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 9 times [2022-04-28 14:40:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:37,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797844535] [2022-04-28 14:40:37,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:37,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 10 times [2022-04-28 14:40:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:37,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589220707] [2022-04-28 14:40:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:37,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:37,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:37,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566336059] [2022-04-28 14:40:37,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:40:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:37,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:37,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:37,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:40:37,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:40:37,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:37,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 14:40:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:38,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:38,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:40:38,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:40:38,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-28 14:40:38,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} is VALID [2022-04-28 14:40:38,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} assume !false; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} is VALID [2022-04-28 14:40:38,415 INFO L272 TraceCheckUtils]: 13: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,416 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} #57#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} is VALID [2022-04-28 14:40:38,416 INFO L272 TraceCheckUtils]: 18: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,417 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} #59#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} is VALID [2022-04-28 14:40:38,417 INFO L272 TraceCheckUtils]: 23: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,418 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} #61#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} is VALID [2022-04-28 14:40:38,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (<= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:38,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} assume !false; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:38,419 INFO L272 TraceCheckUtils]: 30: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,419 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} #57#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:38,419 INFO L272 TraceCheckUtils]: 35: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,420 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} #59#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:38,420 INFO L272 TraceCheckUtils]: 40: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,421 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} #61#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-28 14:40:38,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (<= main_~s~0 (+ main_~t~0 1)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:38,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} assume !false; {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:38,422 INFO L272 TraceCheckUtils]: 47: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,423 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} #57#return; {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-28 14:40:38,423 INFO L272 TraceCheckUtils]: 52: Hoare triple {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3899#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:38,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:38,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:38,424 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} {3874#(and (= (+ main_~t~0 (- 4)) 1) (<= (+ main_~s~0 1) (* main_~t~0 2)) (= (+ (- 1) main_~a~0) 1))} #59#return; {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} is VALID [2022-04-28 14:40:38,425 INFO L272 TraceCheckUtils]: 57: Hoare triple {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,431 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} #61#return; {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} is VALID [2022-04-28 14:40:38,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {3910#(and (= 5 main_~t~0) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~a~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-28 14:40:38,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} assume !false; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-28 14:40:38,432 INFO L272 TraceCheckUtils]: 64: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,432 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,432 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,432 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} #57#return; {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} is VALID [2022-04-28 14:40:38,433 INFO L272 TraceCheckUtils]: 69: Hoare triple {3929#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~s~0 (* (- 1) main_~a~0 main_~a~0)) 7))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:38,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:38,433 INFO L290 TraceCheckUtils]: 71: Hoare triple {3955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:40:38,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:40:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 40 proven. 31 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 14:40:38,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:40:38,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-28 14:40:38,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {3955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-28 14:40:38,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:38,963 INFO L272 TraceCheckUtils]: 69: Hoare triple {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:38,963 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:38,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,964 INFO L272 TraceCheckUtils]: 64: Hoare triple {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:38,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3971#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:40:38,967 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:38,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,967 INFO L272 TraceCheckUtils]: 57: Hoare triple {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,968 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} #59#return; {3993#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:40:38,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:38,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {4022#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3903#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:38,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {4022#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:40:38,969 INFO L272 TraceCheckUtils]: 52: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,970 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} #57#return; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-28 14:40:38,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,970 INFO L272 TraceCheckUtils]: 47: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} assume !false; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-28 14:40:38,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4012#(or (not (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)) (= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2)))} is VALID [2022-04-28 14:40:38,974 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #61#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-28 14:40:38,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,974 INFO L272 TraceCheckUtils]: 40: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,975 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #59#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-28 14:40:38,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,975 INFO L272 TraceCheckUtils]: 35: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,976 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} #57#return; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-28 14:40:38,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,976 INFO L272 TraceCheckUtils]: 30: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} assume !false; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-28 14:40:38,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4047#(or (not (= (+ main_~t~0 2) (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3 (* (- 1) main_~s~0)))) (= (+ (* main_~a~0 4) (* (- 1) main_~s~0) 8 (* (* (+ main_~a~0 1) (+ main_~a~0 1)) 2)) (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2)))))} is VALID [2022-04-28 14:40:38,979 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #61#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-28 14:40:38,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,979 INFO L272 TraceCheckUtils]: 23: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,980 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #59#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-28 14:40:38,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,980 INFO L272 TraceCheckUtils]: 18: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,981 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} #57#return; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-28 14:40:38,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,981 INFO L272 TraceCheckUtils]: 13: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} assume !false; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4099#(or (not (= (+ (* main_~a~0 2) 3 (* (- 1) main_~s~0) (* (+ main_~a~0 2) (+ main_~a~0 2)) (* (- 1) main_~t~0)) (+ main_~t~0 4))) (= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~a~0 4) (* (- 1) main_~s~0) (* (- 1) main_~t~0) 10 (* 2 (* (+ main_~a~0 2) (+ main_~a~0 2))))))} is VALID [2022-04-28 14:40:38,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {3732#true} is VALID [2022-04-28 14:40:38,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-28 14:40:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 48 proven. 23 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 14:40:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:40:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589220707] [2022-04-28 14:40:38,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:40:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566336059] [2022-04-28 14:40:38,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566336059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:40:38,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:40:38,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 14:40:38,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:40:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797844535] [2022-04-28 14:40:38,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797844535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:40:38,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:40:38,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:40:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017742888] [2022-04-28 14:40:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:40:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 73 [2022-04-28 14:40:38,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:40:38,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 14:40:39,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:39,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:40:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:39,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:40:39,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:40:39,024 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 14:40:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:39,833 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-04-28 14:40:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:40:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 73 [2022-04-28 14:40:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:40:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 14:40:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-28 14:40:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 14:40:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-28 14:40:39,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2022-04-28 14:40:39,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:39,912 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:40:39,912 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 14:40:39,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:40:39,913 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:40:39,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:40:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 14:40:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 14:40:39,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:40:39,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:39,956 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:39,956 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:39,958 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:40:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:39,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:39,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:39,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 14:40:39,959 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 14:40:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:40:39,961 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:40:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:39,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:40:39,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:40:39,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:40:39,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:40:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 14:40:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-28 14:40:39,963 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 73 [2022-04-28 14:40:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:40:39,964 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-28 14:40:39,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-28 14:40:39,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 97 transitions. [2022-04-28 14:40:40,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:40:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 14:40:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 14:40:40,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:40:40,059 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:40:40,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:40:40,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:40,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:40:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:40:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 11 times [2022-04-28 14:40:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:40:40,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740094973] [2022-04-28 14:40:40,417 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:40:40,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:40:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 12 times [2022-04-28 14:40:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:40:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170253588] [2022-04-28 14:40:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:40:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:40:40,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:40:40,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897045579] [2022-04-28 14:40:40,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:40:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:40:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:40:40,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:40:40,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:40:40,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 14:40:40,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:40:40,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:40:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:40:40,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:40:40,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {4756#true} call ULTIMATE.init(); {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4756#true} {4756#true} #69#return; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {4756#true} call #t~ret5 := main(); {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {4756#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4756#true} {4756#true} #55#return; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {4756#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4756#true} is VALID [2022-04-28 14:40:40,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L272 TraceCheckUtils]: 13: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L272 TraceCheckUtils]: 18: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L272 TraceCheckUtils]: 23: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L272 TraceCheckUtils]: 30: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L272 TraceCheckUtils]: 35: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,774 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L272 TraceCheckUtils]: 40: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L272 TraceCheckUtils]: 47: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:40:40,775 INFO L272 TraceCheckUtils]: 52: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L272 TraceCheckUtils]: 57: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L272 TraceCheckUtils]: 64: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L272 TraceCheckUtils]: 69: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:40:40,777 INFO L272 TraceCheckUtils]: 74: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {4756#true} ~cond := #in~cond; {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:40,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:40,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:40,780 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4756#true} #61#return; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:40,781 INFO L290 TraceCheckUtils]: 79: Hoare triple {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:40,781 INFO L290 TraceCheckUtils]: 80: Hoare triple {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:40:40,781 INFO L272 TraceCheckUtils]: 81: Hoare triple {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:40:40,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {4756#true} ~cond := #in~cond; {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:40,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {4986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:40,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:40:40,784 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4997#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-28 14:40:40,784 INFO L272 TraceCheckUtils]: 86: Hoare triple {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:40:40,784 INFO L290 TraceCheckUtils]: 87: Hoare triple {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5027#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:40:40,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {5027#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4757#false} is VALID [2022-04-28 14:40:40,785 INFO L290 TraceCheckUtils]: 89: Hoare triple {4757#false} assume !false; {4757#false} is VALID [2022-04-28 14:40:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-28 14:40:40,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:21,507 INFO L290 TraceCheckUtils]: 89: Hoare triple {4757#false} assume !false; {4757#false} is VALID [2022-04-28 14:41:21,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {5027#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4757#false} is VALID [2022-04-28 14:41:21,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5027#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:21,509 INFO L272 TraceCheckUtils]: 86: Hoare triple {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5023#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:23,511 WARN L284 TraceCheckUtils]: 85: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {5046#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} #57#return; {5019#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is UNKNOWN [2022-04-28 14:41:23,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:23,512 INFO L290 TraceCheckUtils]: 83: Hoare triple {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:23,513 INFO L290 TraceCheckUtils]: 82: Hoare triple {4756#true} ~cond := #in~cond; {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:23,513 INFO L272 TraceCheckUtils]: 81: Hoare triple {5046#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {5046#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !false; {5046#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:23,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {5066#(or (= (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1))) (+ (* main_~s~0 4) 8 (* main_~t~0 4))) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {5046#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:23,829 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} {4756#true} #61#return; {5066#(or (= (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1))) (+ (* main_~s~0 4) 8 (* main_~t~0 4))) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-28 14:41:23,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:23,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:23,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {4756#true} ~cond := #in~cond; {5056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:23,841 INFO L272 TraceCheckUtils]: 74: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L272 TraceCheckUtils]: 69: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,841 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L272 TraceCheckUtils]: 64: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 59: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,842 INFO L272 TraceCheckUtils]: 57: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L272 TraceCheckUtils]: 52: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L272 TraceCheckUtils]: 47: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:41:23,843 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L272 TraceCheckUtils]: 40: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L272 TraceCheckUtils]: 35: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L272 TraceCheckUtils]: 30: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {4756#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4756#true} {4756#true} #61#return; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L272 TraceCheckUtils]: 23: Hoare triple {4756#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4756#true} {4756#true} #59#return; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {4756#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4756#true} {4756#true} #57#return; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L272 TraceCheckUtils]: 13: Hoare triple {4756#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {4756#true} assume !false; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {4756#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4756#true} {4756#true} #55#return; {4756#true} is VALID [2022-04-28 14:41:23,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#true} assume !(0 == ~cond); {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#true} ~cond := #in~cond; {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {4756#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 10 then 1 else 0)); {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {4756#true} call #t~ret5 := main(); {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4756#true} {4756#true} #69#return; {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#true} assume true; {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4756#true} is VALID [2022-04-28 14:41:23,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {4756#true} call ULTIMATE.init(); {4756#true} is VALID [2022-04-28 14:41:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-28 14:41:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170253588] [2022-04-28 14:41:23,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897045579] [2022-04-28 14:41:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897045579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:23,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:23,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-28 14:41:23,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:23,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740094973] [2022-04-28 14:41:23,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740094973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:23,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:23,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:41:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533872825] [2022-04-28 14:41:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-28 14:41:23,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:23,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:23,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:23,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:41:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:41:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2022-04-28 14:41:23,910 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:24,424 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 14:41:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:41:24,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-28 14:41:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 14:41:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 14:41:24,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 14:41:24,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:24,456 INFO L225 Difference]: With dead ends: 93 [2022-04-28 14:41:24,456 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:41:24,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=44, Invalid=136, Unknown=2, NotChecked=0, Total=182 [2022-04-28 14:41:24,457 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:24,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:41:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:41:24,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:24,458 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:24,458 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:24,458 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:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:24,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:24,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:24,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:24,459 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:24,459 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:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:24,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:24,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:24,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:24,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:24,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:24,459 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:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:41:24,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-04-28 14:41:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:24,460 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:41:24,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:41:24,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:41:24,460 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:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:24,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:24,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:41:24,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:24,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:41:24,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:41:25,491 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:41:25,491 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:41:25,491 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:41:25,491 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:25,491 INFO L902 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-28 14:41:25,491 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:25,491 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:25,491 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,491 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-28 14:41:25,492 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:25,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,492 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:25,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,492 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,493 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,493 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:25,493 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:41:25,493 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:25,493 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:25,493 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:25,493 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:25,493 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:25,495 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2, 2] [2022-04-28 14:41:25,496 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:41:25,498 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:41:25,507 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:41:25,515 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:25,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:25 BoogieIcfgContainer [2022-04-28 14:41:25,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:41:25,524 INFO L158 Benchmark]: Toolchain (without parser) took 55323.76ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 173.8MB in the beginning and 195.8MB in the end (delta: -22.0MB). Peak memory consumption was 89.9MB. Max. memory is 8.0GB. [2022-04-28 14:41:25,524 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 222.3MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:41:25,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.53ms. Allocated memory is still 222.3MB. Free memory was 173.5MB in the beginning and 197.6MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 14:41:25,524 INFO L158 Benchmark]: Boogie Preprocessor took 16.82ms. Allocated memory is still 222.3MB. Free memory was 197.6MB in the beginning and 196.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:41:25,524 INFO L158 Benchmark]: RCFGBuilder took 206.90ms. Allocated memory is still 222.3MB. Free memory was 196.2MB in the beginning and 185.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:25,524 INFO L158 Benchmark]: TraceAbstraction took 54929.89ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 184.6MB in the beginning and 195.8MB in the end (delta: -11.2MB). Peak memory consumption was 101.9MB. Max. memory is 8.0GB. [2022-04-28 14:41:25,525 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 222.3MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.53ms. Allocated memory is still 222.3MB. Free memory was 173.5MB in the beginning and 197.6MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.82ms. Allocated memory is still 222.3MB. Free memory was 197.6MB in the beginning and 196.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.90ms. Allocated memory is still 222.3MB. Free memory was 196.2MB in the beginning and 185.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 54929.89ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 184.6MB in the beginning and 195.8MB in the end (delta: -11.2MB). Peak memory consumption was 101.9MB. 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: 54.9s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 296 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 661 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 223 PreInvPairs, 338 NumberOfFragments, 249 HoareAnnotationTreeSize, 223 FomulaSimplifications, 556 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1534 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: t * 2 + t * t + 1 == s * 4 && t == a * 2 + 1 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:41:25,543 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...