/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:37:46,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:37:47,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:37:47,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:37:47,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:37:47,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:37:47,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:37:47,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:37:47,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:37:47,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:37:47,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:37:47,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:37:47,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:37:47,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:37:47,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:37:47,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:37:47,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:37:47,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:37:47,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:37:47,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:37:47,062 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:37:47,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:37:47,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:37:47,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:37:47,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:37:47,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:37:47,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:37:47,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:37:47,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:37:47,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:37:47,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:37:47,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:37:47,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:37:47,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:37:47,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:37:47,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:37:47,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:37:47,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:37:47,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:37:47,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:37:47,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:37:47,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:37:47,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:37:47,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:37:47,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:37:47,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:37:47,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:37:47,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:47,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:37:47,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:37:47,096 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:37:47,096 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:37:47,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:37:47,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:37:47,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:37:47,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:37:47,319 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:37:47,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-08 14:37:47,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4147cbef/68f4332cc71a4da5aebf12b13890ce0b/FLAG4dfa8abeb [2022-04-08 14:37:47,727 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:37:47,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c [2022-04-08 14:37:47,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4147cbef/68f4332cc71a4da5aebf12b13890ce0b/FLAG4dfa8abeb [2022-04-08 14:37:47,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4147cbef/68f4332cc71a4da5aebf12b13890ce0b [2022-04-08 14:37:47,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:37:47,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:37:47,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:47,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:37:47,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:37:47,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798014ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47, skipping insertion in model container [2022-04-08 14:37:47,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:37:47,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:37:47,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-08 14:37:47,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:47,915 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:37:47,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound100.c[520,533] [2022-04-08 14:37:47,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:37:47,943 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:37:47,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47 WrapperNode [2022-04-08 14:37:47,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:37:47,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:37:47,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:37:47,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:37:47,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:37:47,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:37:47,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:37:47,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:37:47,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (1/1) ... [2022-04-08 14:37:47,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:37:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:47,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:37:47,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:37:48,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:37:48,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:37:48,010 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:37:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:37:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:37:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:37:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:37:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:37:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:37:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:37:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:37:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:37:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:37:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:37:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:37:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:37:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:37:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:37:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:37:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:37:48,056 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:37:48,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:37:48,207 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:37:48,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:37:48,212 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:37:48,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:48 BoogieIcfgContainer [2022-04-08 14:37:48,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:37:48,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:37:48,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:37:48,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:37:48,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:37:47" (1/3) ... [2022-04-08 14:37:48,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302edbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:48, skipping insertion in model container [2022-04-08 14:37:48,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:37:47" (2/3) ... [2022-04-08 14:37:48,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302edbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:37:48, skipping insertion in model container [2022-04-08 14:37:48,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:37:48" (3/3) ... [2022-04-08 14:37:48,238 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound100.c [2022-04-08 14:37:48,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:37:48,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:37:48,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:37:48,290 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:37:48,291 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:37:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:37:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:37:48,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:48,321 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:48,321 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-08 14:37:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:48,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [528461752] [2022-04-08 14:37:48,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-08 14:37:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:48,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880668741] [2022-04-08 14:37:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:48,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-08 14:37:48,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 14:37:48,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-08 14:37:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:37:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:48,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 14:37:48,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 14:37:48,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 14:37:48,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-08 14:37:48,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:37:48,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-08 14:37:48,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 14:37:48,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-08 14:37:48,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-08 14:37:48,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-08 14:37:48,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {34#true} is VALID [2022-04-08 14:37:48,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 14:37:48,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 14:37:48,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 14:37:48,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-08 14:37:48,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-08 14:37:48,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-08 14:37:48,562 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-08 14:37:48,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 14:37:48,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 14:37:48,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 14:37:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:48,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:48,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880668741] [2022-04-08 14:37:48,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880668741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:48,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:48,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:48,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [528461752] [2022-04-08 14:37:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [528461752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:48,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:48,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:37:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218172985] [2022-04-08 14:37:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:37:48,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:48,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:48,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:48,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:37:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:37:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:37:48,633 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:48,800 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-08 14:37:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:37:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:37:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 14:37:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-08 14:37:48,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-08 14:37:48,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:48,923 INFO L225 Difference]: With dead ends: 53 [2022-04-08 14:37:48,923 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:37:48,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:37:48,929 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:48,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:37:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:37:48,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:48,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:37:48,950 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:37:48,951 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:37:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:48,954 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 14:37:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:48,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:48,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:48,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-08 14:37:48,955 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-08 14:37:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:48,958 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 14:37:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:48,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:48,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:48,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:48,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:37:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-08 14:37:48,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-08 14:37:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:48,962 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-08 14:37:48,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:48,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-08 14:37:48,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 14:37:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:37:48,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:48,991 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:48,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:37:48,992 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-08 14:37:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257942101] [2022-04-08 14:37:48,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-08 14:37:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330706210] [2022-04-08 14:37:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:37:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:49,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-08 14:37:49,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:49,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-08 14:37:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:37:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:49,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-08 14:37:49,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-08 14:37:49,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:49,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-08 14:37:49,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:37:49,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-08 14:37:49,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:49,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-08 14:37:49,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-08 14:37:49,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-08 14:37:49,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {256#true} is VALID [2022-04-08 14:37:49,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-08 14:37:49,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-08 14:37:49,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 14:37:49,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-08 14:37:49,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:37:49,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:37:49,090 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:49,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:37:49,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-08 14:37:49,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-08 14:37:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:49,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330706210] [2022-04-08 14:37:49,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330706210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:49,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:49,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:49,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:49,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257942101] [2022-04-08 14:37:49,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257942101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:49,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:49,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665223271] [2022-04-08 14:37:49,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:49,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:37:49,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:49,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:49,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:49,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:37:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:37:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:49,107 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:49,506 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 14:37:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:37:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:37:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 14:37:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 14:37:49,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-08 14:37:49,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:49,571 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:37:49,571 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:37:49,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:37:49,575 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:49,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:37:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:37:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-08 14:37:49,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:49,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:49,595 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:49,595 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:49,600 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:49,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:49,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:49,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:37:49,601 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:37:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:49,603 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:37:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:37:49,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:49,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:49,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:49,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:37:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 14:37:49,606 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-08 14:37:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:49,607 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 14:37:49,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:37:49,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 14:37:49,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 14:37:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:37:49,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:49,658 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:49,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:37:49,659 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-08 14:37:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:49,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8070776] [2022-04-08 14:37:49,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-08 14:37:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:49,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494954913] [2022-04-08 14:37:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:49,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883792921] [2022-04-08 14:37:49,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:49,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:49,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:37:49,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:49,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:49,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:49,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-08 14:37:49,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-08 14:37:49,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:49,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-08 14:37:49,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-08 14:37:49,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-08 14:37:49,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {507#true} is VALID [2022-04-08 14:37:49,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-08 14:37:49,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-08 14:37:49,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:49,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-08 14:37:49,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:49,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:49,916 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-08 14:37:49,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-08 14:37:49,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-08 14:37:49,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-08 14:37:49,917 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:37:49,918 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:49,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:49,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-08 14:37:49,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-08 14:37:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:37:49,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:49,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494954913] [2022-04-08 14:37:49,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:49,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883792921] [2022-04-08 14:37:49,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883792921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:49,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8070776] [2022-04-08 14:37:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8070776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:49,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33552065] [2022-04-08 14:37:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:37:49,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:49,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:49,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:49,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:49,944 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,091 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 14:37:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:50,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:37:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:50,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 14:37:50,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:50,135 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:37:50,135 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 14:37:50,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:50,136 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:50,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 14:37:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-08 14:37:50,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:50,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:50,145 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:50,145 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,147 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 14:37:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 14:37:50,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:50,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:50,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-08 14:37:50,148 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-08 14:37:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,150 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 14:37:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 14:37:50,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:50,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:50,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:50,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-08 14:37:50,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-08 14:37:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:50,153 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-08 14:37:50,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:37:50,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-08 14:37:50,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-08 14:37:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:37:50,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:50,197 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:50,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 14:37:50,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:50,412 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-08 14:37:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404984315] [2022-04-08 14:37:50,413 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:37:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-08 14:37:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:50,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333284802] [2022-04-08 14:37:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:50,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501346041] [2022-04-08 14:37:50,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:50,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:50,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:50,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:37:50,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:50,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:50,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:37:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:50,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:50,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-08 14:37:50,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-08 14:37:50,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:50,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-08 14:37:50,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-08 14:37:50,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-08 14:37:50,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {833#true} is VALID [2022-04-08 14:37:50,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:50,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:50,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:50,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-08 14:37:50,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:50,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:50,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-08 14:37:50,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:50,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:50,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:50,588 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:50,588 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-08 14:37:50,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-08 14:37:50,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-08 14:37:50,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-08 14:37:50,590 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:50,590 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:50,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:50,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-08 14:37:50,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-08 14:37:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:37:50,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:37:50,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333284802] [2022-04-08 14:37:50,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501346041] [2022-04-08 14:37:50,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501346041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:50,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:50,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:50,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404984315] [2022-04-08 14:37:50,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404984315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:50,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:50,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:50,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914885820] [2022-04-08 14:37:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 14:37:50,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:50,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:50,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:50,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:37:50,611 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,755 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 14:37:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 14:37:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 14:37:50,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 14:37:50,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:50,800 INFO L225 Difference]: With dead ends: 48 [2022-04-08 14:37:50,800 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 14:37:50,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:37:50,801 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:50,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 14:37:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 14:37:50,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:50,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:50,814 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:50,814 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,815 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:37:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:50,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:50,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:50,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-08 14:37:50,816 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-08 14:37:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:50,817 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:37:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:50,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:50,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:50,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:50,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 14:37:50,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-08 14:37:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:50,820 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 14:37:50,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:37:50,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-08 14:37:50,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:37:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:37:50,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:50,865 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:50,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:51,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 14:37:51,078 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-08 14:37:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299749684] [2022-04-08 14:37:51,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:51,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-08 14:37:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:51,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796588226] [2022-04-08 14:37:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:51,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885207428] [2022-04-08 14:37:51,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:51,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:51,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:37:51,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:51,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:51,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:37:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:51,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:51,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-08 14:37:51,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-08 14:37:51,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-08 14:37:51,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:51,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:51,474 INFO L272 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,476 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:51,476 INFO L272 TraceCheckUtils]: 18: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,486 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:51,486 INFO L272 TraceCheckUtils]: 23: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,487 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:37:51,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 14:37:51,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 14:37:51,488 INFO L272 TraceCheckUtils]: 30: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:51,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:51,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-08 14:37:51,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-08 14:37:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:37:51,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:51,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-08 14:37:51,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-08 14:37:51,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:51,622 INFO L272 TraceCheckUtils]: 30: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:51,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,624 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,624 INFO L272 TraceCheckUtils]: 23: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,625 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,625 INFO L272 TraceCheckUtils]: 18: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,626 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,626 INFO L272 TraceCheckUtils]: 13: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:37:51,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-08 14:37:51,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-08 14:37:51,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-08 14:37:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 14:37:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:51,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796588226] [2022-04-08 14:37:51,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:51,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885207428] [2022-04-08 14:37:51,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885207428] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:37:51,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:37:51,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:37:51,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:51,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299749684] [2022-04-08 14:37:51,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299749684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:51,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:51,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:51,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247007509] [2022-04-08 14:37:51,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:51,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 14:37:51,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:51,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:51,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:51,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:37:51,651 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:51,761 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-08 14:37:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:51,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 14:37:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:51,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 14:37:51,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:51,789 INFO L225 Difference]: With dead ends: 49 [2022-04-08 14:37:51,789 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:37:51,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:51,790 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:51,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:37:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 14:37:51,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:51,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:51,808 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:51,808 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:51,809 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:37:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:51,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:51,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:51,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 14:37:51,810 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 14:37:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:51,811 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:37:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:51,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:51,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:51,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:51,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:37:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 14:37:51,813 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-08 14:37:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:51,813 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 14:37:51,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:51,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-08 14:37:51,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:37:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:37:51,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:51,855 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:51,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:52,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:52,068 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-08 14:37:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901147495] [2022-04-08 14:37:52,236 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:52,236 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-08 14:37:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473424317] [2022-04-08 14:37:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:52,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460784682] [2022-04-08 14:37:52,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:37:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:52,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:37:52,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:37:52,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:52,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:37:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:52,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:52,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-08 14:37:52,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-08 14:37:52,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-08 14:37:52,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-08 14:37:52,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:52,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:52,438 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,438 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:52,439 INFO L272 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:52,439 INFO L272 TraceCheckUtils]: 23: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,440 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:52,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-08 14:37:52,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} assume !false; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-08 14:37:52,441 INFO L272 TraceCheckUtils]: 30: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,450 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1776#(and (= main_~a~0 1) (= main_~s~0 4))} #57#return; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-08 14:37:52,451 INFO L272 TraceCheckUtils]: 35: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:52,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:52,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-08 14:37:52,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-08 14:37:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:37:52,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:52,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-08 14:37:52,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-08 14:37:52,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:52,592 INFO L272 TraceCheckUtils]: 35: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:52,593 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:52,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,593 INFO L272 TraceCheckUtils]: 30: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:52,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:52,635 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:52,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,635 INFO L272 TraceCheckUtils]: 23: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,636 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:52,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,636 INFO L272 TraceCheckUtils]: 18: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,637 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:52,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:52,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:52,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-08 14:37:52,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-08 14:37:52,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-08 14:37:52,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-08 14:37:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:37:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:52,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473424317] [2022-04-08 14:37:52,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:52,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460784682] [2022-04-08 14:37:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460784682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:52,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:52,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 14:37:52,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:52,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901147495] [2022-04-08 14:37:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901147495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:52,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:52,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:37:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74521639] [2022-04-08 14:37:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-08 14:37:52,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:52,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 14:37:52,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:52,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:37:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:37:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:52,670 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 14:37:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:52,901 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-08 14:37:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:37:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-08 14:37:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 14:37:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 14:37:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 14:37:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 14:37:52,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 14:37:52,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:52,952 INFO L225 Difference]: With dead ends: 61 [2022-04-08 14:37:52,952 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 14:37:52,952 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:37:52,953 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:52,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:37:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 14:37:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 14:37:52,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:52,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:52,973 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:52,973 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:52,975 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 14:37:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-08 14:37:52,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:52,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:52,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-08 14:37:52,975 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-08 14:37:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:52,977 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 14:37:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-08 14:37:52,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:52,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:52,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:52,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-08 14:37:52,979 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-08 14:37:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:52,979 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-08 14:37:52,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 14:37:52,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-08 14:37:53,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-08 14:37:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 14:37:53,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:53,039 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:53,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:53,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:53,247 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-08 14:37:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633057436] [2022-04-08 14:37:53,397 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:53,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-08 14:37:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:53,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647852898] [2022-04-08 14:37:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:53,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:53,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106014468] [2022-04-08 14:37:53,405 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:37:53,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:53,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:53,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:53,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:37:53,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 14:37:53,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:53,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:37:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:53,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:53,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-08 14:37:53,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:53,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:53,598 INFO L272 TraceCheckUtils]: 13: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:53,599 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:53,599 INFO L272 TraceCheckUtils]: 23: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,600 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2323#(and (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2323#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:53,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {2323#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:37:53,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} assume !false; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:37:53,601 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,601 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #57#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:37:53,602 INFO L272 TraceCheckUtils]: 35: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,602 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #59#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:37:53,603 INFO L272 TraceCheckUtils]: 40: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:53,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:53,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-08 14:37:53,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-08 14:37:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:37:53,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:53,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-08 14:37:53,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-08 14:37:53,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:53,765 INFO L272 TraceCheckUtils]: 40: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:53,766 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,766 INFO L272 TraceCheckUtils]: 35: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,766 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,767 INFO L272 TraceCheckUtils]: 30: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,769 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #61#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,769 INFO L272 TraceCheckUtils]: 23: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,771 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,772 INFO L272 TraceCheckUtils]: 13: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:53,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-08 14:37:53,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-08 14:37:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 14:37:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:53,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647852898] [2022-04-08 14:37:53,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:53,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106014468] [2022-04-08 14:37:53,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106014468] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:37:53,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:37:53,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:37:53,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:53,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633057436] [2022-04-08 14:37:53,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633057436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:53,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:53,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:37:53,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536721477] [2022-04-08 14:37:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-08 14:37:53,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:53,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:53,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:53,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:37:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:37:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:37:53,794 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:53,966 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-08 14:37:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:37:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-08 14:37:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 14:37:53,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 14:37:53,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:53,997 INFO L225 Difference]: With dead ends: 64 [2022-04-08 14:37:53,997 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 14:37:53,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:37:53,997 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:53,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:37:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 14:37:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 14:37:54,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:54,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:54,019 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:54,019 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:54,021 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-08 14:37:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:54,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:54,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:54,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-08 14:37:54,021 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-08 14:37:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:54,023 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-08 14:37:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:54,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:54,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:54,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:54,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:37:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-08 14:37:54,025 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-08 14:37:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:54,025 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-08 14:37:54,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:37:54,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-08 14:37:54,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-08 14:37:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 14:37:54,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:54,093 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:54,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:54,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:54,307 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-08 14:37:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952889493] [2022-04-08 14:37:54,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:54,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-08 14:37:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:54,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393129001] [2022-04-08 14:37:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:54,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:54,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515057497] [2022-04-08 14:37:54,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:37:54,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:54,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:37:54,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:37:54,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:54,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:37:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:54,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:54,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-08 14:37:54,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:54,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:54,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:54,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,754 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:54,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,755 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:54,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {2959#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-08 14:37:54,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !false; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-08 14:37:54,756 INFO L272 TraceCheckUtils]: 30: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,757 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #57#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-08 14:37:54,757 INFO L272 TraceCheckUtils]: 35: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,758 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #59#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-08 14:37:54,758 INFO L272 TraceCheckUtils]: 40: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,763 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} #61#return; {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} is VALID [2022-04-08 14:37:54,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {3011#(and (= main_~a~0 1) (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (= main_~t~0 3))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:54,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} assume !false; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:54,765 INFO L272 TraceCheckUtils]: 47: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,769 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} #57#return; {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:54,769 INFO L272 TraceCheckUtils]: 52: Hoare triple {3063#(and (= 5 (+ main_~s~0 (- 4))) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:54,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:54,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-08 14:37:54,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-08 14:37:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:37:54,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:54,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-08 14:37:54,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {3089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2922#false} is VALID [2022-04-08 14:37:54,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:54,953 INFO L272 TraceCheckUtils]: 52: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:54,953 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:54,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,953 INFO L272 TraceCheckUtils]: 47: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:54,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3105#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:54,960 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:54,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,960 INFO L272 TraceCheckUtils]: 40: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,960 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L272 TraceCheckUtils]: 35: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,961 INFO L272 TraceCheckUtils]: 30: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:54,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3127#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:54,964 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:54,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,964 INFO L272 TraceCheckUtils]: 23: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L272 TraceCheckUtils]: 18: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,965 INFO L272 TraceCheckUtils]: 13: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {2921#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3179#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:54,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2921#true} {2921#true} #55#return; {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {2921#true} is VALID [2022-04-08 14:37:54,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-08 14:37:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:37:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:54,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393129001] [2022-04-08 14:37:54,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:54,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515057497] [2022-04-08 14:37:54,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515057497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:54,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:54,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 14:37:54,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952889493] [2022-04-08 14:37:54,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952889493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:54,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:54,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:37:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148353267] [2022-04-08 14:37:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-08 14:37:54,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:54,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 14:37:55,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:55,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:37:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:37:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:37:55,009 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 14:37:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:55,368 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-04-08 14:37:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:37:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-08 14:37:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 14:37:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 14:37:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 14:37:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-08 14:37:55,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-08 14:37:55,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:55,417 INFO L225 Difference]: With dead ends: 80 [2022-04-08 14:37:55,417 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:37:55,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:37:55,418 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:55,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:37:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:37:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:37:55,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:55,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:55,455 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:55,455 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:55,457 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:37:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:55,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:55,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:55,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 14:37:55,457 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 14:37:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:55,459 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:37:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:55,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:55,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:55,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:55,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:37:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-08 14:37:55,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 56 [2022-04-08 14:37:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:55,461 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-08 14:37:55,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 14:37:55,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-08 14:37:55,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-08 14:37:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 14:37:55,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:55,553 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:55,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:55,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:55,756 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 9 times [2022-04-08 14:37:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:55,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447228068] [2022-04-08 14:37:55,906 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:55,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1903584988, now seen corresponding path program 10 times [2022-04-08 14:37:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:55,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966415902] [2022-04-08 14:37:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:55,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:55,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239227265] [2022-04-08 14:37:55,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:37:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:55,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:55,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:37:55,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:37:55,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:55,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 14:37:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:55,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:56,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-08 14:37:56,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:56,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:56,280 INFO L272 TraceCheckUtils]: 13: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,281 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:56,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,282 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:56,283 INFO L272 TraceCheckUtils]: 23: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,283 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:37:56,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {3770#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-08 14:37:56,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} assume !false; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-08 14:37:56,284 INFO L272 TraceCheckUtils]: 30: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #57#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-08 14:37:56,285 INFO L272 TraceCheckUtils]: 35: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #59#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-08 14:37:56,285 INFO L272 TraceCheckUtils]: 40: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,286 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} #61#return; {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2022-04-08 14:37:56,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {3822#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1) (= main_~s~0 (+ main_~t~0 1)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:56,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} assume !false; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:56,287 INFO L272 TraceCheckUtils]: 47: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #57#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:56,288 INFO L272 TraceCheckUtils]: 52: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #59#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:56,288 INFO L272 TraceCheckUtils]: 57: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,293 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} #61#return; {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} is VALID [2022-04-08 14:37:56,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {3874#(and (= (+ main_~s~0 (- 3) (* (- 1) main_~t~0)) 1) (= (+ main_~s~0 (* (- 1) main_~t~0) 1) main_~t~0) (= (+ (- 1) main_~a~0) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-08 14:37:56,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} assume !false; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-08 14:37:56,294 INFO L272 TraceCheckUtils]: 64: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,294 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,296 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} #57#return; {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} is VALID [2022-04-08 14:37:56,297 INFO L272 TraceCheckUtils]: 69: Hoare triple {3926#(and (= (+ (- 2) main_~a~0) 1) (= (+ (- 9) main_~s~0) 7))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:56,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:56,298 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-08 14:37:56,298 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-08 14:37:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:37:56,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:37:56,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-08 14:37:56,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3733#false} is VALID [2022-04-08 14:37:56,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:56,570 INFO L272 TraceCheckUtils]: 69: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:56,570 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3732#true} {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:56,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,571 INFO L272 TraceCheckUtils]: 64: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:56,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3968#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:37:56,574 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:56,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,574 INFO L272 TraceCheckUtils]: 57: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,574 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:56,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,575 INFO L272 TraceCheckUtils]: 52: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,576 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3732#true} {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:56,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,576 INFO L272 TraceCheckUtils]: 47: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:56,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3990#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:37:56,578 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #61#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L272 TraceCheckUtils]: 40: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #59#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,579 INFO L272 TraceCheckUtils]: 35: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,580 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3732#true} {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} #57#return; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:56,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,580 INFO L272 TraceCheckUtils]: 30: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} assume !false; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:56,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4042#(= (+ (* main_~a~0 2) 5 (* (+ main_~a~0 2) (+ main_~a~0 2))) (+ main_~s~0 6 (* main_~t~0 2)))} is VALID [2022-04-08 14:37:56,583 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #61#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-08 14:37:56,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,583 INFO L272 TraceCheckUtils]: 23: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,583 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #59#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-08 14:37:56,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L272 TraceCheckUtils]: 18: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3732#true} {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} #57#return; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-08 14:37:56,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,584 INFO L272 TraceCheckUtils]: 13: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} assume !false; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {3732#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4094#(= (+ 7 (* main_~a~0 2) (* (+ main_~a~0 3) (+ main_~a~0 3))) (+ (* main_~t~0 3) main_~s~0 12))} is VALID [2022-04-08 14:37:56,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3732#true} {3732#true} #55#return; {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {3732#true} assume !(0 == ~cond); {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {3732#true} ~cond := #in~cond; {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {3732#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret5 := main(); {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #69#return; {3732#true} is VALID [2022-04-08 14:37:56,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-08 14:37:56,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3732#true} is VALID [2022-04-08 14:37:56,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3732#true} is VALID [2022-04-08 14:37:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:37:56,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:37:56,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966415902] [2022-04-08 14:37:56,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:37:56,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239227265] [2022-04-08 14:37:56,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239227265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:37:56,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:37:56,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-08 14:37:56,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:37:56,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447228068] [2022-04-08 14:37:56,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447228068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:37:56,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:37:56,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:37:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59573922] [2022-04-08 14:37:56,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:37:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-08 14:37:56,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:37:56,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 14:37:56,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:56,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:37:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:37:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:37:56,623 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 14:37:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:57,126 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-04-08 14:37:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:37:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2022-04-08 14:37:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:37:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 14:37:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-08 14:37:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 14:37:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-04-08 14:37:57,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2022-04-08 14:37:57,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:57,197 INFO L225 Difference]: With dead ends: 97 [2022-04-08 14:37:57,197 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 14:37:57,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:37:57,198 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:37:57,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 172 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:37:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 14:37:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 14:37:57,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:37:57,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:37:57,237 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:37:57,237 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:37:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:57,240 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:37:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:57,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:57,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:57,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 14:37:57,241 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 14:37:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:37:57,243 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:37:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:57,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:37:57,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:37:57,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:37:57,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:37:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 15 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:37:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-08 14:37:57,246 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 73 [2022-04-08 14:37:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:37:57,246 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-08 14:37:57,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 14:37:57,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 97 transitions. [2022-04-08 14:37:57,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:37:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 14:37:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 14:37:57,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:37:57,350 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:37:57,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:37:57,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:57,563 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:37:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:37:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 11 times [2022-04-08 14:37:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:37:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366365055] [2022-04-08 14:37:57,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:37:57,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:37:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1485297034, now seen corresponding path program 12 times [2022-04-08 14:37:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:37:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682407882] [2022-04-08 14:37:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:37:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:37:57,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:37:57,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419927258] [2022-04-08 14:37:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:37:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:37:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:37:57,703 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:37:57,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:37:57,762 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:37:57,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:37:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:37:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:37:57,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:37:58,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {4749#true} call ULTIMATE.init(); {4749#true} is VALID [2022-04-08 14:37:58,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4749#true} {4749#true} #69#return; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {4749#true} call #t~ret5 := main(); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {4749#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {4749#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4749#true} {4749#true} #55#return; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {4749#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L272 TraceCheckUtils]: 13: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:37:58,072 INFO L272 TraceCheckUtils]: 18: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L272 TraceCheckUtils]: 23: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L272 TraceCheckUtils]: 30: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:37:58,073 INFO L272 TraceCheckUtils]: 35: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L272 TraceCheckUtils]: 40: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:37:58,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L272 TraceCheckUtils]: 47: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L272 TraceCheckUtils]: 52: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L272 TraceCheckUtils]: 57: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:37:58,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:37:58,076 INFO L272 TraceCheckUtils]: 64: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L272 TraceCheckUtils]: 69: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:37:58,078 INFO L272 TraceCheckUtils]: 74: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {4749#true} ~cond := #in~cond; {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:58,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:58,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:58,080 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4749#true} #61#return; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:58,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:58,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:37:58,082 INFO L272 TraceCheckUtils]: 81: Hoare triple {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:37:58,083 INFO L290 TraceCheckUtils]: 82: Hoare triple {4749#true} ~cond := #in~cond; {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:58,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {4979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:58,083 INFO L290 TraceCheckUtils]: 84: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:37:58,085 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4990#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-08 14:37:58,086 INFO L272 TraceCheckUtils]: 86: Hoare triple {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:37:58,086 INFO L290 TraceCheckUtils]: 87: Hoare triple {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:37:58,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {5020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4750#false} is VALID [2022-04-08 14:37:58,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {4750#false} assume !false; {4750#false} is VALID [2022-04-08 14:37:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-08 14:37:58,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:38:32,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {4750#false} assume !false; {4750#false} is VALID [2022-04-08 14:38:32,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {5020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4750#false} is VALID [2022-04-08 14:38:32,339 INFO L290 TraceCheckUtils]: 87: Hoare triple {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:38:32,339 INFO L272 TraceCheckUtils]: 86: Hoare triple {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {5016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:38:32,840 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} #57#return; {5012#(= (* main_~s~0 4) (+ (* main_~a~0 4) 3 (* (+ (* main_~a~0 2) 1) (+ (* main_~a~0 2) 1))))} is VALID [2022-04-08 14:38:32,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:32,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:32,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {4749#true} ~cond := #in~cond; {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:38:32,841 INFO L272 TraceCheckUtils]: 81: Hoare triple {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:32,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !false; {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-08 14:38:34,843 WARN L290 TraceCheckUtils]: 79: Hoare triple {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is UNKNOWN [2022-04-08 14:38:35,048 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} {4749#true} #61#return; {5039#(or (= (+ 3 (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 4) (* (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1) (+ (* (div (+ (* (- 1) main_~t~0) 1) (- 2)) 2) 1))) (* main_~s~0 4)) (not (= (mod (+ main_~t~0 1) 2) 0)))} is VALID [2022-04-08 14:38:35,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:35,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {4749#true} ~cond := #in~cond; {5049#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:38:35,050 INFO L272 TraceCheckUtils]: 74: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L272 TraceCheckUtils]: 69: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 67: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L272 TraceCheckUtils]: 64: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:38:35,050 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L272 TraceCheckUtils]: 57: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:38:35,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L272 TraceCheckUtils]: 52: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L272 TraceCheckUtils]: 47: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:38:35,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L272 TraceCheckUtils]: 40: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L272 TraceCheckUtils]: 30: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4749#true} {4749#true} #61#return; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L272 TraceCheckUtils]: 23: Hoare triple {4749#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4749#true} {4749#true} #59#return; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {4749#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4749#true} {4749#true} #57#return; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L272 TraceCheckUtils]: 13: Hoare triple {4749#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {4749#true} assume !false; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4749#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4749#true} {4749#true} #55#return; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {4749#true} assume !(0 == ~cond); {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4749#true} ~cond := #in~cond; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {4749#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 100 then 1 else 0)); {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {4749#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {4749#true} call #t~ret5 := main(); {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4749#true} {4749#true} #69#return; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {4749#true} assume true; {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4749#true} is VALID [2022-04-08 14:38:35,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {4749#true} call ULTIMATE.init(); {4749#true} is VALID [2022-04-08 14:38:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-08 14:38:35,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:38:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682407882] [2022-04-08 14:38:35,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:38:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419927258] [2022-04-08 14:38:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419927258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:38:35,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:38:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:38:35,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:38:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366365055] [2022-04-08 14:38:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366365055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:38:35,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:38:35,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:38:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582837424] [2022-04-08 14:38:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:38:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-08 14:38:35,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:38:35,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 14:38:35,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:38:35,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:38:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:38:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:38:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:38:35,092 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 14:38:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:35,501 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 14:38:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:38:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-04-08 14:38:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:38:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 14:38:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:38:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 14:38:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:38:35,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 14:38:35,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:38:35,535 INFO L225 Difference]: With dead ends: 93 [2022-04-08 14:38:35,535 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:38:35,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:38:35,536 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:38:35,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:38:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:38:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:38:35,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:38:35,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:35,537 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:35,537 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:35,537 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:38:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:35,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:35,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:38:35,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:38:35,537 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:38:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:38:35,537 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:38:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:35,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:35,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:38:35,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:38:35,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:38:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:38:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:38:35,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-04-08 14:38:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:38:35,538 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:38:35,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 14:38:35,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:38:35,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:38:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:38:35,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:38:35,540 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:38:35,558 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-08 14:38:35,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 14:38:35,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:38:36,479 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 14:38:36,479 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 14:38:36,479 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L885 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-08 14:38:36,480 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1)))) [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:38:36,481 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:38:36,484 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2, 2] [2022-04-08 14:38:36,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:38:36,487 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:38:36,489 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:38:36,496 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:38:36,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:38:36 BoogieIcfgContainer [2022-04-08 14:38:36,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:38:36,504 INFO L158 Benchmark]: Toolchain (without parser) took 48752.04ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 133.1MB in the beginning and 163.8MB in the end (delta: -30.7MB). Peak memory consumption was 113.0MB. Max. memory is 8.0GB. [2022-04-08 14:38:36,504 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 76.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:38:36,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.68ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 157.6MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 14:38:36,505 INFO L158 Benchmark]: Boogie Preprocessor took 19.44ms. Allocated memory is still 182.5MB. Free memory was 157.6MB in the beginning and 156.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:38:36,505 INFO L158 Benchmark]: RCFGBuilder took 249.90ms. Allocated memory is still 182.5MB. Free memory was 156.3MB in the beginning and 145.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:38:36,505 INFO L158 Benchmark]: TraceAbstraction took 48288.43ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 144.7MB in the beginning and 163.8MB in the end (delta: -19.0MB). Peak memory consumption was 126.2MB. Max. memory is 8.0GB. [2022-04-08 14:38:36,506 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 182.5MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 76.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.68ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 157.6MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.44ms. Allocated memory is still 182.5MB. Free memory was 157.6MB in the beginning and 156.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.90ms. Allocated memory is still 182.5MB. Free memory was 156.3MB in the beginning and 145.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 48288.43ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 144.7MB in the beginning and 163.8MB in the end (delta: -19.0MB). Peak memory consumption was 126.2MB. 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: 48.2s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 970 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 304 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 666 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 223 PreInvPairs, 336 NumberOfFragments, 249 HoareAnnotationTreeSize, 223 FomulaSimplifications, 490 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 31 FomulaSimplificationsInter, 1416 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: t * 2 + t * t + 1 == s * 4 && t == a * 2 + 1 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-08 14:38:36,524 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...