/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:41:24,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:41:24,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:41:24,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:41:24,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:41:24,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:41:24,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:41:24,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:41:24,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:41:24,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:41:24,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:41:24,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:41:24,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:41:24,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:41:24,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:41:24,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:41:24,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:41:24,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:41:24,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:41:24,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:41:24,832 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:41:24,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:41:24,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:41:24,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:41:24,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:41:24,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:41:24,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:41:24,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:41:24,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:41:24,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:41:24,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:41:24,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:41:24,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:41:24,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:41:24,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:41:24,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:41:24,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:41:24,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:41:24,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:41:24,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:41:24,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:41:24,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:41:24,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:41:24,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:41:24,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:41:24,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:41:24,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:41:24,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:41:24,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:41:24,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:41:24,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:41:24,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:41:24,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:41:24,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:41:24,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:41:24,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:41:24,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:41:24,860 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:41:25,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:41:25,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:41:25,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:41:25,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:41:25,085 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:41:25,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-04-28 14:41:25,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95a70b21/0499d69500354ef9ae81e8818eb0c3f8/FLAGb53eb27ea [2022-04-28 14:41:25,497 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:41:25,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-04-28 14:41:25,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95a70b21/0499d69500354ef9ae81e8818eb0c3f8/FLAGb53eb27ea [2022-04-28 14:41:25,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95a70b21/0499d69500354ef9ae81e8818eb0c3f8 [2022-04-28 14:41:25,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:41:25,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:41:25,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:41:25,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:41:25,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:41:25,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b4355e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25, skipping insertion in model container [2022-04-28 14:41:25,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:41:25,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:41:25,680 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_valuebound2.c[520,533] [2022-04-28 14:41:25,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:41:25,716 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:41:25,726 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_valuebound2.c[520,533] [2022-04-28 14:41:25,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:41:25,752 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:41:25,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25 WrapperNode [2022-04-28 14:41:25,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:41:25,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:41:25,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:41:25,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:41:25,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:41:25,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:41:25,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:41:25,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:41:25,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 14:41:25,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:41:25,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:25,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:41:25,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:41:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:41:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:41:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:41:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:41:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:41:25,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:41:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:41:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:41:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:41:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:41:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:41:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:41:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:41:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:41:25,903 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:41:25,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:41:26,025 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:41:26,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:41:26,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:41:26,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26 BoogieIcfgContainer [2022-04-28 14:41:26,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:41:26,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:41:26,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:41:26,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:41:26,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:25" (1/3) ... [2022-04-28 14:41:26,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b38fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 14:41:26,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (2/3) ... [2022-04-28 14:41:26,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b38fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 14:41:26,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26" (3/3) ... [2022-04-28 14:41:26,044 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.c [2022-04-28 14:41:26,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:41:26,053 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:41:26,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:41:26,100 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36236c7f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ed688e8 [2022-04-28 14:41:26,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:41:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:41:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:41:26,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:26,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:26,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 14:41:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713220525] [2022-04-28 14:41:26,130 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 14:41:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:26,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112234183] [2022-04-28 14:41:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:41:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:41:26,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:41:26,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:41:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:41:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:41:26,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:41:26,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:41:26,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:41:26,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:41:26,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 14:41:26,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 14:41:26,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 14:41:26,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 14:41:26,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-28 14:41:26,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {34#true} is VALID [2022-04-28 14:41:26,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 14:41:26,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 14:41:26,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 14:41:26,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 14:41:26,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 14:41:26,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 14:41:26,304 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-28 14:41:26,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 14:41:26,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 14:41:26,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 14:41:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112234183] [2022-04-28 14:41:26,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112234183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:26,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:26,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:41:26,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:26,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713220525] [2022-04-28 14:41:26,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713220525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:26,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:26,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:41:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19250551] [2022-04-28 14:41:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:26,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:26,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:26,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:26,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:41:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:41:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:41:26,358 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:26,520 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 14:41:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:41:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:41:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 14:41:26,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 14:41:26,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:26,629 INFO L225 Difference]: With dead ends: 53 [2022-04-28 14:41:26,629 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:41:26,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:41:26,635 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:26,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:41:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:41:26,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:26,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:26,657 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:26,657 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:26,661 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:41:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:26,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:26,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:26,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:41:26,662 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 14:41:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:26,667 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 14:41:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:26,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:26,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:26,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:26,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:41:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 14:41:26,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 14:41:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:26,672 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 14:41:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 14:41:26,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 14:41:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:41:26,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:26,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:26,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:41:26,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 14:41:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:26,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586185344] [2022-04-28 14:41:26,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 14:41:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979460015] [2022-04-28 14:41:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:41:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:41:26,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:26,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:41:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:41:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:26,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:41:26,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:41:26,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:26,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:41:26,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:41:26,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 14:41:26,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:26,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 14:41:26,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 14:41:26,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-28 14:41:26,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {256#true} is VALID [2022-04-28 14:41:26,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 14:41:26,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 14:41:26,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 14:41:26,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 14:41:26,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:41:26,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:41:26,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:41:26,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:41:26,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 14:41:26,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 14:41:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979460015] [2022-04-28 14:41:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979460015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:26,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:26,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586185344] [2022-04-28 14:41:26,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586185344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:26,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:26,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600571703] [2022-04-28 14:41:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:26,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:26,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:26,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:41:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:41:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:26,907 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,294 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:41:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:41:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:41:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:41:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 14:41:27,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 14:41:27,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:27,360 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:41:27,361 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:41:27,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:41:27,362 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:27,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:41:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:41:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 14:41:27,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:27,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:27,371 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:27,371 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,373 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:41:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:41:27,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:27,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:27,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:41:27,375 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-28 14:41:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,377 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:41:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:41:27,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:27,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:27,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:27,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 14:41:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 14:41:27,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 14:41:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:27,381 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 14:41:27,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:41:27,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 14:41:27,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 14:41:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:41:27,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:27,436 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:27,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:41:27,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 14:41:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:27,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825671207] [2022-04-28 14:41:27,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 14:41:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927711447] [2022-04-28 14:41:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:27,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:27,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991550496] [2022-04-28 14:41:27,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:27,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:27,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:41:27,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:27,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:27,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:41:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:27,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:27,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 14:41:27,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-28 14:41:27,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:27,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 14:41:27,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 14:41:27,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-28 14:41:27,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {507#true} is VALID [2022-04-28 14:41:27,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:41:27,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:41:27,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:27,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 14:41:27,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:27,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:27,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-28 14:41:27,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 14:41:27,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 14:41:27,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 14:41:27,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:41:27,681 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:27,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:27,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 14:41:27,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 14:41:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:41:27,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:41:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:27,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927711447] [2022-04-28 14:41:27,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:27,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991550496] [2022-04-28 14:41:27,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991550496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:27,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:27,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:27,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:27,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825671207] [2022-04-28 14:41:27,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825671207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:27,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:27,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676450642] [2022-04-28 14:41:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:41:27,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:27,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:27,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:27,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:41:27,701 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,831 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:41:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:27,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 14:41:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:27,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:41:27,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:27,878 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:41:27,878 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 14:41:27,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:27,879 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:27,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 14:41:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 14:41:27,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:27,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:27,890 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:27,890 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,892 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:41:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:41:27,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:27,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:27,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:41:27,894 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 14:41:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:27,895 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 14:41:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 14:41:27,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:27,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:27,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:27,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 14:41:27,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 14:41:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:27,898 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 14:41:27,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:41:27,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 14:41:27,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 14:41:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:41:27,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:27,947 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:27,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:28,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 14:41:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429626817] [2022-04-28 14:41:28,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:41:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 14:41:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45108974] [2022-04-28 14:41:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:28,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168312859] [2022-04-28 14:41:28,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:28,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:28,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:41:28,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:28,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:28,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:41:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:28,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:28,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 14:41:28,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-28 14:41:28,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:28,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 14:41:28,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 14:41:28,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-28 14:41:28,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:28,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:28,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:28,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:28,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 14:41:28,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:28,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:28,331 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:28,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:28,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:28,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:28,334 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:28,334 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-28 14:41:28,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 14:41:28,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 14:41:28,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 14:41:28,335 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:28,335 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:28,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:28,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 14:41:28,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 14:41:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:41:28,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:41:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:28,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45108974] [2022-04-28 14:41:28,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168312859] [2022-04-28 14:41:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168312859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:28,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:28,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:28,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429626817] [2022-04-28 14:41:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429626817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:28,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:28,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24533168] [2022-04-28 14:41:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:41:28,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:28,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:28,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:28,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:41:28,359 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:28,495 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 14:41:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 14:41:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 14:41:28,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 14:41:28,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:28,545 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:41:28,546 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 14:41:28,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:41:28,548 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:28,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 14:41:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 14:41:28,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:28,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:28,565 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:28,566 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:28,569 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:41:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:28,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:28,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:28,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:41:28,573 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 14:41:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:28,576 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 14:41:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:28,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:28,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:28,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:28,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 14:41:28,579 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 14:41:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:28,579 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 14:41:28,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:41:28,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 14:41:28,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 14:41:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:41:28,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:28,621 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:28,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 14:41:28,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 14:41:28,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 14:41:28,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002694520] [2022-04-28 14:41:29,108 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:29,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 2 times [2022-04-28 14:41:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:29,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158095944] [2022-04-28 14:41:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:29,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:29,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894930731] [2022-04-28 14:41:29,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:29,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:29,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:41:29,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:29,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:29,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:41:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:29,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:29,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:41:29,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:41:29,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:41:29,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:41:29,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:41:29,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:41:29,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:29,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:29,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,292 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:29,292 INFO L272 TraceCheckUtils]: 18: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,304 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:29,304 INFO L272 TraceCheckUtils]: 23: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,305 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1226#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:41:29,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:41:29,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-28 14:41:29,306 INFO L272 TraceCheckUtils]: 30: Hoare triple {1278#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:29,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:29,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:41:29,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:41:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:41:29,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:29,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 14:41:29,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 14:41:29,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:29,446 INFO L272 TraceCheckUtils]: 30: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:29,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,447 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,448 INFO L272 TraceCheckUtils]: 23: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,448 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,449 INFO L272 TraceCheckUtils]: 18: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,449 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1188#true} {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,449 INFO L272 TraceCheckUtils]: 13: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1305#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:41:29,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 14:41:29,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 14:41:29,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 14:41:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 14:41:29,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158095944] [2022-04-28 14:41:29,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894930731] [2022-04-28 14:41:29,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894930731] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:41:29,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:41:29,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:41:29,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:29,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002694520] [2022-04-28 14:41:29,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002694520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:29,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:29,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806623426] [2022-04-28 14:41:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:29,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:41:29,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:29,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:29,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:29,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:29,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:41:29,475 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:29,591 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-28 14:41:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:29,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 14:41:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:29,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:41:29,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:29,622 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:41:29,622 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:41:29,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:29,624 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:29,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:41:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:41:29,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:29,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:29,646 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:29,646 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:29,648 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:41:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:29,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:29,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:29,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:41:29,649 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 14:41:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:29,651 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 14:41:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:29,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:29,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:29,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:29,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 14:41:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 14:41:29,653 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-28 14:41:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:29,653 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 14:41:29,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:29,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 14:41:29,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 14:41:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:41:29,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:29,703 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:29,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:29,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:29,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 3 times [2022-04-28 14:41:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:29,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447121945] [2022-04-28 14:41:30,087 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:30,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 4 times [2022-04-28 14:41:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:30,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13410728] [2022-04-28 14:41:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:30,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469603997] [2022-04-28 14:41:30,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:41:30,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:30,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:30,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:41:30,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:41:30,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:30,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:41:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:30,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:30,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:41:30,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:30,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:30,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,328 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:30,328 INFO L272 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:30,330 INFO L272 TraceCheckUtils]: 23: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,330 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:30,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {1724#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:30,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} assume !false; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:30,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,335 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1776#(and (= main_~a~0 1) (= main_~s~0 4))} #57#return; {1776#(and (= main_~a~0 1) (= main_~s~0 4))} is VALID [2022-04-28 14:41:30,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {1776#(and (= main_~a~0 1) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:30,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:30,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:41:30,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:41:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:41:30,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:30,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2022-04-28 14:41:30,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1687#false} is VALID [2022-04-28 14:41:30,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:30,495 INFO L272 TraceCheckUtils]: 35: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:30,496 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1686#true} {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:30,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,496 INFO L272 TraceCheckUtils]: 30: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:30,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1818#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:41:30,516 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:30,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,517 INFO L272 TraceCheckUtils]: 23: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,517 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:30,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,518 INFO L272 TraceCheckUtils]: 18: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,518 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1686#true} {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:30,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,518 INFO L272 TraceCheckUtils]: 13: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:30,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1840#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:30,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1686#true} {1686#true} #55#return; {1686#true} is VALID [2022-04-28 14:41:30,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == ~cond); {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1686#true} ~cond := #in~cond; {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {1686#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {1686#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {1686#true} call #t~ret5 := main(); {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1686#true} {1686#true} #69#return; {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {1686#true} assume true; {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {1686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2022-04-28 14:41:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:41:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:30,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13410728] [2022-04-28 14:41:30,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:30,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469603997] [2022-04-28 14:41:30,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469603997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:30,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:30,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 14:41:30,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:30,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447121945] [2022-04-28 14:41:30,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447121945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:30,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:30,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:41:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873332395] [2022-04-28 14:41:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:30,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:41:30,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:30,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:30,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:41:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:41:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:30,549 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:30,776 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 14:41:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:41:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 14:41:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:41:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 14:41:30,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 14:41:30,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:30,822 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:41:30,822 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:41:30,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:41:30,823 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:30,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:41:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:41:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 14:41:30,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:30,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:30,844 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:30,844 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:30,846 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:41:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:41:30,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:30,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:30,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:41:30,846 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 59 states. [2022-04-28 14:41:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:30,848 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-28 14:41:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 14:41:30,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:30,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:30,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:30,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 14:41:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-04-28 14:41:30,850 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 39 [2022-04-28 14:41:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:30,850 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-04-28 14:41:30,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 14:41:30,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 67 transitions. [2022-04-28 14:41:30,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-28 14:41:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:41:30,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:30,915 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:30,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:31,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:31,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 5 times [2022-04-28 14:41:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634404176] [2022-04-28 14:41:31,287 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:31,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1537313192, now seen corresponding path program 6 times [2022-04-28 14:41:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:31,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828684435] [2022-04-28 14:41:31,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:31,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:31,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766750286] [2022-04-28 14:41:31,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:41:31,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:31,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:31,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:31,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:41:31,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:41:31,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:31,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:41:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:31,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:31,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:41:31,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:31,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:31,513 INFO L272 TraceCheckUtils]: 13: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,513 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:31,514 INFO L272 TraceCheckUtils]: 18: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,514 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:31,514 INFO L272 TraceCheckUtils]: 23: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,515 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:41:31,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {2323#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:31,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} assume !false; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:31,516 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #57#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:31,517 INFO L272 TraceCheckUtils]: 35: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,518 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #59#return; {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-28 14:41:31,518 INFO L272 TraceCheckUtils]: 40: Hoare triple {2375#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:31,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:31,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:41:31,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:41:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:41:31,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:31,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-28 14:41:31,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {2416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2286#false} is VALID [2022-04-28 14:41:31,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:41:31,732 INFO L272 TraceCheckUtils]: 40: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:41:31,733 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,733 INFO L272 TraceCheckUtils]: 35: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,733 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,734 INFO L272 TraceCheckUtils]: 30: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,736 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #61#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,736 INFO L272 TraceCheckUtils]: 23: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #59#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,738 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2285#true} {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #57#return; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,738 INFO L272 TraceCheckUtils]: 13: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} assume !false; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2432#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-28 14:41:31,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2285#true} {2285#true} #55#return; {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} assume !(0 == ~cond); {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {2285#true} ~cond := #in~cond; {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {2285#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret5 := main(); {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #69#return; {2285#true} is VALID [2022-04-28 14:41:31,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-28 14:41:31,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2285#true} is VALID [2022-04-28 14:41:31,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2285#true} is VALID [2022-04-28 14:41:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 14:41:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828684435] [2022-04-28 14:41:31,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766750286] [2022-04-28 14:41:31,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766750286] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:41:31,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:41:31,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:41:31,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634404176] [2022-04-28 14:41:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634404176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:31,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:31,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:41:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974162879] [2022-04-28 14:41:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:41:31,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:31,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:31,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:31,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:41:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:41:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:41:31,760 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:31,931 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-28 14:41:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:41:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-28 14:41:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 14:41:31,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 14:41:31,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:31,959 INFO L225 Difference]: With dead ends: 64 [2022-04-28 14:41:31,959 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 14:41:31,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:41:31,960 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:31,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 14:41:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 14:41:31,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:31,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:31,985 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:31,985 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:31,987 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:41:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:31,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:31,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:31,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:41:31,987 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 59 states. [2022-04-28 14:41:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:31,989 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-28 14:41:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:31,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:31,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:31,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 14:41:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 14:41:31,991 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 44 [2022-04-28 14:41:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:31,991 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 14:41:31,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:41:31,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 14:41:32,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 14:41:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 14:41:32,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:41:32,056 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:41:32,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:32,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:41:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:41:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 7 times [2022-04-28 14:41:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:32,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190247866] [2022-04-28 14:41:32,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:41:32,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:41:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 790038090, now seen corresponding path program 8 times [2022-04-28 14:41:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:41:32,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732389053] [2022-04-28 14:41:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:41:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:41:32,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:41:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223673891] [2022-04-28 14:41:32,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:41:32,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:32,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:41:32,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:41:32,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:41:32,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:41:32,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:41:32,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:41:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:41:32,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:41:32,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:41:32,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {2947#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:41:32,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2951#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:32,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {2951#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2951#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:32,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2951#(not (= |assume_abort_if_not_#in~cond| 0))} {2921#true} #55#return; {2958#(and (<= main_~n~0 2) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(and (<= main_~n~0 2) (<= 0 main_~n~0))} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} assume !false; {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,814 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} #57#return; {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} #59#return; {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,815 INFO L272 TraceCheckUtils]: 23: Hoare triple {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,816 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} #61#return; {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {2962#(and (<= main_~n~0 2) (<= 1 main_~s~0) (<= 1 main_~t~0) (<= 0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} assume !false; {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,817 INFO L272 TraceCheckUtils]: 30: Hoare triple {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} #57#return; {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,818 INFO L272 TraceCheckUtils]: 35: Hoare triple {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,819 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} #59#return; {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,819 INFO L272 TraceCheckUtils]: 40: Hoare triple {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:32,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:32,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:32,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:32,822 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} #61#return; {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {3014#(and (<= main_~n~0 2) (<= 4 main_~s~0) (<= 0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L272 TraceCheckUtils]: 47: Hoare triple {2922#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {2922#false} ~cond := #in~cond; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {2922#false} assume !(0 == ~cond); {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {2922#false} assume true; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2922#false} {2922#false} #57#return; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L272 TraceCheckUtils]: 52: Hoare triple {2922#false} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {2922#false} ~cond := #in~cond; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {2922#false} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:41:32,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 42 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-28 14:41:32,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:41:33,088 INFO L290 TraceCheckUtils]: 55: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:33,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {2922#false} assume 0 == ~cond; {2922#false} is VALID [2022-04-28 14:41:33,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {2922#false} ~cond := #in~cond; {2922#false} is VALID [2022-04-28 14:41:33,119 INFO L272 TraceCheckUtils]: 52: Hoare triple {2922#false} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2922#false} is VALID [2022-04-28 14:41:33,119 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2921#true} {2922#false} #57#return; {2922#false} is VALID [2022-04-28 14:41:33,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,120 INFO L272 TraceCheckUtils]: 47: Hoare triple {2922#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {2922#false} assume !false; {2922#false} is VALID [2022-04-28 14:41:33,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {3126#(not (<= main_~s~0 main_~n~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2922#false} is VALID [2022-04-28 14:41:33,123 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2921#true} {3126#(not (<= main_~s~0 main_~n~0))} #61#return; {3126#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:33,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,123 INFO L272 TraceCheckUtils]: 40: Hoare triple {3126#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,124 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2921#true} {3126#(not (<= main_~s~0 main_~n~0))} #59#return; {3126#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:33,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,124 INFO L272 TraceCheckUtils]: 35: Hoare triple {3126#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,125 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2921#true} {3126#(not (<= main_~s~0 main_~n~0))} #57#return; {3126#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:33,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,125 INFO L272 TraceCheckUtils]: 30: Hoare triple {3126#(not (<= main_~s~0 main_~n~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {3126#(not (<= main_~s~0 main_~n~0))} assume !false; {3126#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:33,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3126#(not (<= main_~s~0 main_~n~0))} is VALID [2022-04-28 14:41:33,127 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2921#true} {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #61#return; {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:33,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,127 INFO L272 TraceCheckUtils]: 23: Hoare triple {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,128 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2921#true} {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #59#return; {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:33,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,128 INFO L272 TraceCheckUtils]: 18: Hoare triple {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,129 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2921#true} {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} #57#return; {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:33,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#true} assume !(0 == ~cond); {2921#true} is VALID [2022-04-28 14:41:33,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#true} ~cond := #in~cond; {2921#true} is VALID [2022-04-28 14:41:33,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} assume !false; {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:33,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3230#(< main_~n~0 4)} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {3178#(< main_~n~0 (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-28 14:41:33,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2951#(not (= |assume_abort_if_not_#in~cond| 0))} {2921#true} #55#return; {3230#(< main_~n~0 4)} is VALID [2022-04-28 14:41:33,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {2951#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2951#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:33,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2951#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:41:33,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {2921#true} ~cond := #in~cond; {3243#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:41:33,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {2921#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 2 then 1 else 0)); {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#true} call #t~ret5 := main(); {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#true} {2921#true} #69#return; {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#true} assume true; {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2921#true} is VALID [2022-04-28 14:41:33,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {2921#true} call ULTIMATE.init(); {2921#true} is VALID [2022-04-28 14:41:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 14:41:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:41:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732389053] [2022-04-28 14:41:33,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:41:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223673891] [2022-04-28 14:41:33,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223673891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:41:33,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:41:33,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-28 14:41:33,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:41:33,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190247866] [2022-04-28 14:41:33,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190247866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:41:33,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:41:33,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:41:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316314941] [2022-04-28 14:41:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:41:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:41:33,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:41:33,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:33,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:33,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:41:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:41:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:41:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:41:33,166 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:33,368 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-28 14:41:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:41:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2022-04-28 14:41:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:41:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 14:41:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 14:41:33,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-28 14:41:33,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:33,406 INFO L225 Difference]: With dead ends: 67 [2022-04-28 14:41:33,406 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:41:33,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:41:33,407 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:41:33,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:41:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:41:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:41:33,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:41:33,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:33,408 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:33,408 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:33,408 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:33,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:33,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:33,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:33,409 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:41:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:41:33,409 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:41:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:33,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:33,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:41:33,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:41:33,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:41:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:41:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:41:33,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-04-28 14:41:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:41:33,410 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:41:33,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 14:41:33,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:41:33,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:41:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:41:33,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:41:33,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:41:33,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:41:33,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:41:33,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:41:34,504 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:41:34,504 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:41:34,504 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:41:34,504 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:41:34,504 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2)) (.cse1 (<= 0 main_~n~0)) (.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and .cse0 (<= 1 main_~t~0) .cse1 (= main_~s~0 4) .cse2 .cse3) (and .cse0 (= main_~t~0 1) .cse1 .cse2 .cse3))) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2)) (.cse1 (<= 0 main_~n~0)) (.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and .cse0 (<= 1 main_~t~0) .cse1 (= main_~s~0 4) .cse2 .cse3) (and .cse0 (= main_~t~0 1) .cse1 .cse2 .cse3))) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2)) (.cse1 (<= 0 main_~n~0)) (.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and .cse0 (<= 1 main_~t~0) .cse1 (= main_~s~0 4) .cse2 .cse3) (and .cse0 (= main_~t~0 1) .cse1 .cse2 .cse3))) [2022-04-28 14:41:34,505 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:34,505 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:41:34,505 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~a~0 1) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1)))) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2)) (.cse1 (<= 0 main_~n~0)) (.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and .cse0 (<= 1 main_~t~0) .cse1 (= main_~s~0 4) .cse2 .cse3) (and .cse0 (= main_~t~0 1) .cse1 .cse2 .cse3))) [2022-04-28 14:41:34,505 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2)) (.cse1 (<= 0 main_~n~0)) (.cse2 (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))) (.cse3 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and .cse0 (<= 1 main_~t~0) .cse1 (= main_~s~0 4) .cse2 .cse3) (and .cse0 (= main_~t~0 1) .cse1 .cse2 .cse3))) [2022-04-28 14:41:34,505 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (let ((.cse0 (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= main_~t~0 1) (= main_~s~0 1) .cse0) (and (= main_~a~0 1) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) .cse0))) [2022-04-28 14:41:34,505 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= main_~n~0 2) (<= 0 main_~n~0)) [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)) (= main_~t~0 (+ (* main_~a~0 2) 1)))) [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:41:34,506 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:41:34,508 INFO L356 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 2] [2022-04-28 14:41:34,510 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:41:34,512 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:41:34,525 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:41:34,541 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:41:34,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:34 BoogieIcfgContainer [2022-04-28 14:41:34,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:41:34,558 INFO L158 Benchmark]: Toolchain (without parser) took 9040.86ms. Allocated memory was 168.8MB in the beginning and 276.8MB in the end (delta: 108.0MB). Free memory was 120.6MB in the beginning and 170.7MB in the end (delta: -50.1MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. [2022-04-28 14:41:34,559 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 168.8MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:41:34,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.81ms. Allocated memory is still 168.8MB. Free memory was 120.4MB in the beginning and 144.2MB in the end (delta: -23.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:34,559 INFO L158 Benchmark]: Boogie Preprocessor took 39.01ms. Allocated memory is still 168.8MB. Free memory was 144.2MB in the beginning and 143.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:41:34,559 INFO L158 Benchmark]: RCFGBuilder took 246.34ms. Allocated memory is still 168.8MB. Free memory was 142.6MB in the beginning and 132.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:41:34,559 INFO L158 Benchmark]: TraceAbstraction took 8517.27ms. Allocated memory was 168.8MB in the beginning and 276.8MB in the end (delta: 108.0MB). Free memory was 131.7MB in the beginning and 170.7MB in the end (delta: -39.0MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2022-04-28 14:41:34,563 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.15ms. Allocated memory is still 168.8MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.81ms. Allocated memory is still 168.8MB. Free memory was 120.4MB in the beginning and 144.2MB in the end (delta: -23.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.01ms. Allocated memory is still 168.8MB. Free memory was 144.2MB in the beginning and 143.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 246.34ms. Allocated memory is still 168.8MB. Free memory was 142.6MB in the beginning and 132.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8517.27ms. Allocated memory was 168.8MB in the beginning and 276.8MB in the end (delta: 108.0MB). Free memory was 131.7MB in the beginning and 170.7MB in the end (delta: -39.0MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 234 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 365 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 163 PreInvPairs, 221 NumberOfFragments, 513 HoareAnnotationTreeSize, 163 FomulaSimplifications, 153 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 197 FormulaSimplificationTreeSizeReductionInter, 0.7s 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: (((((n <= 2 && 1 <= t) && 0 <= n) && s == 4) && t * 2 + t * t + 1 == s * 4) && t == a * 2 + 1) || ((((n <= 2 && t == 1) && 0 <= n) && 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: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= \old(cond)) || 1 <= cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:41:34,585 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...