/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_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:35:58,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:35:58,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:35:58,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:35:58,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:35:58,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:35:58,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:35:58,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:35:58,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:35:58,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:35:58,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:35:58,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:35:58,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:35:58,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:35:58,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:35:58,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:35:58,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:35:58,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:35:58,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:35:58,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:35:58,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:35:58,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:35:58,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:35:58,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:35:58,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:35:58,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:35:58,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:35:58,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:35:58,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:35:58,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:35:58,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:35:58,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:35:58,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:35:58,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:35:58,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:35:58,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:35:58,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:35:58,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:35:58,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:35:58,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:35:58,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:35:58,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:35:58,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:35:58,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:35:58,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:35:58,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:35:58,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:35:58,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:35:58,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:35:58,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:35:58,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:35:58,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:35:58,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:35:58,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:35:58,875 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:35:59,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:35:59,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:35:59,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:35:59,055 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:35:59,056 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:35:59,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-08 14:35:59,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b5a317f/71e42d05bc4b44339173b9a5453b5d54/FLAG9ea2c1c21 [2022-04-08 14:35:59,400 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:35:59,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-08 14:35:59,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b5a317f/71e42d05bc4b44339173b9a5453b5d54/FLAG9ea2c1c21 [2022-04-08 14:35:59,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b5a317f/71e42d05bc4b44339173b9a5453b5d54 [2022-04-08 14:35:59,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:35:59,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:35:59,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:35:59,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:35:59,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:35:59,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:35:59" (1/1) ... [2022-04-08 14:35:59,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f541ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:59, skipping insertion in model container [2022-04-08 14:35:59,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:35:59" (1/1) ... [2022-04-08 14:35:59,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:35:59,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:35:59,980 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_unwindbound1.c[520,533] [2022-04-08 14:35:59,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:36:00,002 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:36:00,010 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_unwindbound1.c[520,533] [2022-04-08 14:36:00,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:36:00,038 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:36:00,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00 WrapperNode [2022-04-08 14:36:00,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:36:00,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:36:00,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:36:00,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:36:00,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:36:00,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:36:00,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:36:00,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:36:00,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (1/1) ... [2022-04-08 14:36:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:36:00,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:00,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:36:00,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:36:00,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:36:00,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:36:00,145 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:36:00,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:36:00,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:36:00,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:36:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:36:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:36:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:36:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:36:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:36:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:36:00,190 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:36:00,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:36:00,291 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:36:00,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:36:00,316 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:36:00,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:36:00 BoogieIcfgContainer [2022-04-08 14:36:00,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:36:00,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:36:00,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:36:00,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:36:00,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:35:59" (1/3) ... [2022-04-08 14:36:00,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba4ba73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:36:00, skipping insertion in model container [2022-04-08 14:36:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:36:00" (2/3) ... [2022-04-08 14:36:00,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba4ba73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:36:00, skipping insertion in model container [2022-04-08 14:36:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:36:00" (3/3) ... [2022-04-08 14:36:00,323 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2022-04-08 14:36:00,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:36:00,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:36:00,383 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:36:00,388 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:36:00,388 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:36:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:36:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 14:36:00,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:00,409 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:00,409 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-08 14:36:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:00,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399986460] [2022-04-08 14:36:00,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-08 14:36:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:00,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469041158] [2022-04-08 14:36:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:00,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {29#true} is VALID [2022-04-08 14:36:00,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:36:00,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:36:00,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:36:00,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {29#true} is VALID [2022-04-08 14:36:00,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 14:36:00,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 14:36:00,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-08 14:36:00,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-08 14:36:00,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 14:36:00,559 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-08 14:36:00,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 14:36:00,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 14:36:00,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 14:36:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469041158] [2022-04-08 14:36:00,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469041158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:00,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:00,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:36:00,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:00,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399986460] [2022-04-08 14:36:00,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399986460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:00,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:00,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:36:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540340729] [2022-04-08 14:36:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:36:00,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:00,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:00,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:00,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:36:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:36:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:36:00,610 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:00,775 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-08 14:36:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:36:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 14:36:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:36:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 14:36:00,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 14:36:00,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:00,910 INFO L225 Difference]: With dead ends: 47 [2022-04-08 14:36:00,910 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 14:36:00,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:36:00,914 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:00,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:36:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 14:36:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 14:36:00,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:00,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:00,935 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:00,935 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:00,938 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:36:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:36:00,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:00,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:00,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 14:36:00,940 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 14:36:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:00,942 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 14:36:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 14:36:00,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:00,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:00,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:00,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-08 14:36:00,946 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-08 14:36:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:00,946 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-08 14:36:00,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:00,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-08 14:36:00,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-08 14:36:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:36:00,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:00,978 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:00,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:36:00,979 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-08 14:36:00,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924611824] [2022-04-08 14:36:00,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-08 14:36:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:00,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058001640] [2022-04-08 14:36:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:01,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:36:01,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-08 14:36:01,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-08 14:36:01,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {218#false} is VALID [2022-04-08 14:36:01,100 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-08 14:36:01,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-08 14:36:01,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-08 14:36:01,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-08 14:36:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:01,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058001640] [2022-04-08 14:36:01,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058001640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:01,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:01,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:36:01,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:01,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1924611824] [2022-04-08 14:36:01,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1924611824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:01,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:01,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:36:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324991509] [2022-04-08 14:36:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:01,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:01,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:01,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:01,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:01,114 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,269 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 14:36:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:36:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:36:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:36:01,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 14:36:01,314 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-08 14:36:01,316 INFO L225 Difference]: With dead ends: 32 [2022-04-08 14:36:01,317 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 14:36:01,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:01,321 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:01,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:36:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 14:36:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 14:36:01,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:01,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:01,334 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:01,335 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,337 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:36:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:01,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:01,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:01,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 14:36:01,340 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 14:36:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,343 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 14:36:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:01,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:01,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:01,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:01,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:36:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-08 14:36:01,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-08 14:36:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:01,348 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-08 14:36:01,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-08 14:36:01,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 14:36:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:36:01,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:01,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:01,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:36:01,384 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-08 14:36:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018400557] [2022-04-08 14:36:01,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-08 14:36:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241490022] [2022-04-08 14:36:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:36:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:01,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {385#true} is VALID [2022-04-08 14:36:01,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:36:01,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:36:01,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:36:01,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {385#true} is VALID [2022-04-08 14:36:01,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 14:36:01,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 14:36:01,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-08 14:36:01,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:36:01,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:36:01,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 1);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 14:36:01,487 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(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)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:01,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:01,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-08 14:36:01,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 14:36:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:01,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241490022] [2022-04-08 14:36:01,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241490022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:01,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:01,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:36:01,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:01,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018400557] [2022-04-08 14:36:01,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018400557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:01,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:01,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:36:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949075630] [2022-04-08 14:36:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:01,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:01,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:01,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:36:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:36:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:01,504 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,814 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 14:36:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:36:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 14:36:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:36:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 14:36:01,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 14:36:01,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:01,872 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:36:01,872 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:36:01,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:36:01,873 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:01,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:36:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:36:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 14:36:01,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:01,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:36:01,878 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:36:01,879 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:36:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,880 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:36:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:36:01,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:01,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:01,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 14:36:01,882 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 14:36:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:01,885 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 14:36:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 14:36:01,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:01,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:01,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:01,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:36:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 14:36:01,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 14:36:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:01,894 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 14:36:01,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:36:01,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 14:36:01,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 14:36:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:36:01,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:01,932 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:01,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:36:01,932 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-08 14:36:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675928340] [2022-04-08 14:36:01,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-08 14:36:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9205602] [2022-04-08 14:36:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:01,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403346171] [2022-04-08 14:36:01,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:01,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:01,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:01,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:36:01,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:01,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:01,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:36:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:02,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:02,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 14:36:02,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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);~counter~0 := 0; {608#true} is VALID [2022-04-08 14:36:02,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:36:02,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-08 14:36:02,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-08 14:36:02,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,165 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-08 14:36:02,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-08 14:36:02,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-08 14:36:02,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 14:36:02,166 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,167 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(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)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:02,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:02,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 14:36:02,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 14:36:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:36:02,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:36:02,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:02,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9205602] [2022-04-08 14:36:02,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:02,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403346171] [2022-04-08 14:36:02,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403346171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:02,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:02,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:02,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675928340] [2022-04-08 14:36:02,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675928340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:02,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:02,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868587581] [2022-04-08 14:36:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:36:02,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:02,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:02,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:02,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:02,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:02,186 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:02,323 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 14:36:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 14:36:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:02,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:36:02,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:02,365 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:36:02,365 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:36:02,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:02,366 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:02,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:36:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:36:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 14:36:02,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:02,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:36:02,382 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:36:02,383 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:36:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:02,384 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:36:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:36:02,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:02,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:02,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:36:02,385 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 14:36:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:02,387 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 14:36:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 14:36:02,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:02,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:02,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:02,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:36:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 14:36:02,389 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-08 14:36:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:02,389 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 14:36:02,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:36:02,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-08 14:36:02,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 14:36:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:36:02,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:02,426 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:02,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:02,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:02,639 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-08 14:36:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:02,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257450724] [2022-04-08 14:36:02,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:36:02,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-08 14:36:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:02,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673183699] [2022-04-08 14:36:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:02,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:02,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000167384] [2022-04-08 14:36:02,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:02,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:02,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:02,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:02,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:36:02,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:02,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:02,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:36:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:02,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:02,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-08 14:36:02,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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);~counter~0 := 0; {895#true} is VALID [2022-04-08 14:36:02,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:02,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-08 14:36:02,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-08 14:36:02,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,844 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-08 14:36:02,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:36:02,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:36:02,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:02,845 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,851 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(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)); {895#true} is VALID [2022-04-08 14:36:02,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 14:36:02,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 14:36:02,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 14:36:02,852 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:02,853 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(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)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:02,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:02,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-08 14:36:02,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-08 14:36:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:36:02,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:36:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673183699] [2022-04-08 14:36:02,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000167384] [2022-04-08 14:36:02,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000167384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:02,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:02,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:02,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:02,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257450724] [2022-04-08 14:36:02,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257450724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:02,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:02,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378342146] [2022-04-08 14:36:02,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:36:02,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:02,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:02,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:02,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:36:02,875 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:02,996 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 14:36:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:36:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 14:36:02,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 14:36:03,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:03,031 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:36:03,032 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:36:03,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:36:03,032 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:03,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:36:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:36:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:36:03,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:03,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:03,044 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:03,044 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:03,045 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:36:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:03,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:03,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:03,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 14:36:03,046 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 14:36:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:03,047 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:36:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:03,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:03,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:03,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:03,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-08 14:36:03,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-08 14:36:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:03,049 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-08 14:36:03,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:36:03,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-08 14:36:03,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 14:36:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:36:03,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:03,090 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:03,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:03,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:03,307 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-08 14:36:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:03,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063938561] [2022-04-08 14:36:03,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:03,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-08 14:36:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618105476] [2022-04-08 14:36:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:03,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145662103] [2022-04-08 14:36:03,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:03,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:03,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:36:03,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:03,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:03,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:36:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:03,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:03,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:36:03,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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);~counter~0 := 0; {1211#true} is VALID [2022-04-08 14:36:03,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #66#return; {1211#true} is VALID [2022-04-08 14:36:03,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret6 := main(); {1211#true} is VALID [2022-04-08 14:36:03,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,780 INFO L272 TraceCheckUtils]: 8: Hoare triple {1231#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-08 14:36:03,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,781 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,781 INFO L272 TraceCheckUtils]: 13: Hoare triple {1231#(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)); {1211#true} is VALID [2022-04-08 14:36:03,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,782 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,782 INFO L272 TraceCheckUtils]: 18: Hoare triple {1231#(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)); {1211#true} is VALID [2022-04-08 14:36:03,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,785 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1231#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1231#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 14:36:03,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(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; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 14:36:03,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 14:36:03,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !(#t~post5 < 1);havoc #t~post5; {1286#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-08 14:36:03,787 INFO L272 TraceCheckUtils]: 26: Hoare triple {1286#(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)); {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:03,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:03,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {1300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:36:03,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:36:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:36:03,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:03,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-08 14:36:03,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {1300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-08 14:36:03,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:03,931 INFO L272 TraceCheckUtils]: 26: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:03,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !(#t~post5 < 1);havoc #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {1316#(= 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; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,934 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,934 INFO L272 TraceCheckUtils]: 18: Hoare triple {1316#(= 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)); {1211#true} is VALID [2022-04-08 14:36:03,943 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,949 INFO L272 TraceCheckUtils]: 13: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-08 14:36:03,950 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-08 14:36:03,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-08 14:36:03,951 INFO L272 TraceCheckUtils]: 8: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-08 14:36:03,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1316#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-08 14:36:03,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret6 := main(); {1211#true} is VALID [2022-04-08 14:36:03,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #66#return; {1211#true} is VALID [2022-04-08 14:36:03,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-08 14:36:03,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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);~counter~0 := 0; {1211#true} is VALID [2022-04-08 14:36:03,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-08 14:36:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 14:36:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618105476] [2022-04-08 14:36:03,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145662103] [2022-04-08 14:36:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145662103] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:36:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:36:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:36:03,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063938561] [2022-04-08 14:36:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063938561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:36:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868389078] [2022-04-08 14:36:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:03,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 30 [2022-04-08 14:36:03,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:03,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:03,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:03,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:36:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:36:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:36:03,974 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:12,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:36:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:12,148 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:36:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 30 [2022-04-08 14:36:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:36:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:36:12,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:36:12,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:12,195 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:36:12,196 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 14:36:12,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:36:12,196 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:12,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-04-08 14:36:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 14:36:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 14:36:12,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:12,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:12,216 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:12,216 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:12,217 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:36:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:36:12,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:12,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:12,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-08 14:36:12,218 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-08 14:36:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:12,219 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:36:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:36:12,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:12,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:12,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:12,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:36:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 14:36:12,221 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2022-04-08 14:36:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:12,221 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 14:36:12,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:36:12,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-08 14:36:12,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 14:36:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:36:12,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:12,274 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:12,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:12,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:12,475 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -775311695, now seen corresponding path program 1 times [2022-04-08 14:36:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939268357] [2022-04-08 14:36:12,663 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:12,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -775311695, now seen corresponding path program 2 times [2022-04-08 14:36:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:12,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459930306] [2022-04-08 14:36:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:12,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313969063] [2022-04-08 14:36:12,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:12,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:12,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:36:12,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:12,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:12,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:36:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:12,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:12,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-08 14:36:12,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#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);~counter~0 := 0; {1661#true} is VALID [2022-04-08 14:36:12,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-08 14:36:12,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-08 14:36:12,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1661#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,860 INFO L272 TraceCheckUtils]: 8: Hoare triple {1681#(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)); {1661#true} is VALID [2022-04-08 14:36:12,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:12,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:12,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,861 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #54#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,861 INFO L272 TraceCheckUtils]: 13: Hoare triple {1681#(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)); {1661#true} is VALID [2022-04-08 14:36:12,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:12,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:12,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,862 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #56#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,862 INFO L272 TraceCheckUtils]: 18: Hoare triple {1681#(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)); {1661#true} is VALID [2022-04-08 14:36:12,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:12,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:12,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,862 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #58#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 14:36:12,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {1681#(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; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-08 14:36:12,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-08 14:36:12,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} assume !(#t~post5 < 1);havoc #t~post5; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-08 14:36:12,864 INFO L272 TraceCheckUtils]: 26: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-08 14:36:12,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:12,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:12,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,865 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1661#true} {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} #60#return; {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} is VALID [2022-04-08 14:36:12,865 INFO L272 TraceCheckUtils]: 31: Hoare triple {1736#(and (= main_~a~0 1) (= 3 (+ (- 1) main_~s~0)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:12,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:12,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-08 14:36:12,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-08 14:36:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:36:12,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:12,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-08 14:36:12,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-08 14:36:12,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:12,994 INFO L272 TraceCheckUtils]: 31: Hoare triple {1781#(= (+ (* 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)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:12,994 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1661#true} {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #60#return; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:12,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:12,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:12,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:12,995 INFO L272 TraceCheckUtils]: 26: Hoare triple {1781#(= (+ (* 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)); {1661#true} is VALID [2022-04-08 14:36:12,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !(#t~post5 < 1);havoc #t~post5; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:13,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:13,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#(= (+ (* (+ 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; {1781#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:13,040 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #58#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:13,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:13,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:13,040 INFO L272 TraceCheckUtils]: 18: Hoare triple {1806#(= (+ (* (+ 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)); {1661#true} is VALID [2022-04-08 14:36:13,041 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #56#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:13,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:13,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:13,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {1806#(= (+ (* (+ 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)); {1661#true} is VALID [2022-04-08 14:36:13,045 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #54#return; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:13,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-08 14:36:13,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-08 14:36:13,046 INFO L272 TraceCheckUtils]: 8: Hoare triple {1806#(= (+ (* (+ 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)); {1661#true} is VALID [2022-04-08 14:36:13,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(#t~post5 < 1);havoc #t~post5; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1661#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1806#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-08 14:36:13,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-08 14:36:13,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-08 14:36:13,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-08 14:36:13,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#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);~counter~0 := 0; {1661#true} is VALID [2022-04-08 14:36:13,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-08 14:36:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:36:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:13,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459930306] [2022-04-08 14:36:13,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:13,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313969063] [2022-04-08 14:36:13,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313969063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:36:13,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:36:13,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 14:36:13,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:13,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939268357] [2022-04-08 14:36:13,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939268357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:13,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:13,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:36:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732929950] [2022-04-08 14:36:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:36:13,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:13,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:13,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:13,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:36:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:13,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:36:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:36:13,070 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:13,312 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 14:36:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:36:13,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-08 14:36:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 14:36:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 14:36:13,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 14:36:13,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:13,363 INFO L225 Difference]: With dead ends: 58 [2022-04-08 14:36:13,363 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 14:36:13,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:36:13,363 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:13,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:36:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 14:36:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-08 14:36:13,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:13,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:13,383 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:13,383 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:13,385 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 14:36:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 14:36:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:13,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 56 states. [2022-04-08 14:36:13,385 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 56 states. [2022-04-08 14:36:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:13,387 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 14:36:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 14:36:13,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:13,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:13,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:13,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 14:36:13,389 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 35 [2022-04-08 14:36:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:13,389 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 14:36:13,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:36:13,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 14:36:13,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 14:36:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:36:13,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:13,446 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:13,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:13,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:13,664 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 296432442, now seen corresponding path program 1 times [2022-04-08 14:36:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925845837] [2022-04-08 14:36:13,813 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:13,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 296432442, now seen corresponding path program 2 times [2022-04-08 14:36:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053908831] [2022-04-08 14:36:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:13,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:13,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216431842] [2022-04-08 14:36:13,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:36:13,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:13,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:13,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:13,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:36:13,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:36:13,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:13,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 14:36:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:13,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:14,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2218#true} is VALID [2022-04-08 14:36:14,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#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);~counter~0 := 0; {2218#true} is VALID [2022-04-08 14:36:14,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:14,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #66#return; {2218#true} is VALID [2022-04-08 14:36:14,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret6 := main(); {2218#true} is VALID [2022-04-08 14:36:14,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} assume !!(#t~post5 < 1);havoc #t~post5; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,093 INFO L272 TraceCheckUtils]: 8: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:14,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:14,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:14,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:14,094 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #54#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:14,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:14,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:14,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:14,095 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #56#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,095 INFO L272 TraceCheckUtils]: 18: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:14,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:14,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:14,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:14,096 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2218#true} {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} #58#return; {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} is VALID [2022-04-08 14:36:14,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {2238#(and (= main_~t~0 1) (= main_~s~0 1) (<= 0 main_~a~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-08 14:36:14,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-08 14:36:14,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} assume !(#t~post5 < 1);havoc #t~post5; {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} is VALID [2022-04-08 14:36:14,097 INFO L272 TraceCheckUtils]: 26: Hoare triple {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:14,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {2218#true} ~cond := #in~cond; {2306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:14,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {2306#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:14,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:14,098 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} {2293#(and (= (+ main_~s~0 (* (- 1) main_~t~0)) 1) (<= 1 main_~a~0) (= main_~t~0 3))} #60#return; {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:36:14,099 INFO L272 TraceCheckUtils]: 31: Hoare triple {2317#(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)); {2218#true} is VALID [2022-04-08 14:36:14,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:14,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:14,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:14,099 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2218#true} {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} #62#return; {2317#(and (= main_~s~0 (+ main_~t~0 1)) (= main_~t~0 3))} is VALID [2022-04-08 14:36:14,106 INFO L272 TraceCheckUtils]: 36: Hoare triple {2317#(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)); {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:14,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:14,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {2340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2219#false} is VALID [2022-04-08 14:36:14,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-08 14:36:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:36:14,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:15,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-08 14:36:15,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {2340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2219#false} is VALID [2022-04-08 14:36:15,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:15,170 INFO L272 TraceCheckUtils]: 36: Hoare triple {2356#(= (+ (* 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)); {2336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:15,171 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2218#true} {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} #62#return; {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:36:15,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:15,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:15,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:15,172 INFO L272 TraceCheckUtils]: 31: Hoare triple {2356#(= (+ (* 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)); {2218#true} is VALID [2022-04-08 14:36:15,172 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} #60#return; {2356#(= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4))} is VALID [2022-04-08 14:36:15,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:15,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {2385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:15,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {2218#true} ~cond := #in~cond; {2385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:15,174 INFO L272 TraceCheckUtils]: 26: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* 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)); {2218#true} is VALID [2022-04-08 14:36:15,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} assume !(#t~post5 < 1);havoc #t~post5; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is VALID [2022-04-08 14:36:15,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is VALID [2022-04-08 14:36:17,176 WARN L290 TraceCheckUtils]: 23: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2375#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~t~0 2) (* main_~t~0 main_~t~0) 1) (* main_~s~0 4)))} is UNKNOWN [2022-04-08 14:36:17,176 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #58#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:17,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:17,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:17,177 INFO L272 TraceCheckUtils]: 18: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:17,177 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #56#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:17,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L272 TraceCheckUtils]: 13: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2218#true} {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #54#return; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {2218#true} assume !(0 == ~cond); {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2218#true} ~cond := #in~cond; {2218#true} is VALID [2022-04-08 14:36:17,178 INFO L272 TraceCheckUtils]: 8: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2218#true} is VALID [2022-04-08 14:36:17,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} assume !!(#t~post5 < 1);havoc #t~post5; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2398#(or (= (+ (* main_~s~0 4) (* 8 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 4) (+ 3 (* (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)) 4) (* (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1) (+ (* 2 (div (+ (- 1) (* (- 1) main_~t~0)) (- 2))) 1)))) (not (= (mod (+ main_~t~0 1) 2) 0)) (not (<= (+ main_~a~0 1) (div (+ (- 1) (* (- 1) main_~t~0)) (- 2)))))} is VALID [2022-04-08 14:36:17,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret6 := main(); {2218#true} is VALID [2022-04-08 14:36:17,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #66#return; {2218#true} is VALID [2022-04-08 14:36:17,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 14:36:17,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#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);~counter~0 := 0; {2218#true} is VALID [2022-04-08 14:36:17,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2218#true} is VALID [2022-04-08 14:36:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:36:17,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:17,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053908831] [2022-04-08 14:36:17,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:17,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216431842] [2022-04-08 14:36:17,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216431842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:36:17,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:36:17,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-08 14:36:17,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:17,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925845837] [2022-04-08 14:36:17,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925845837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:17,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:17,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:36:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771651641] [2022-04-08 14:36:17,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:36:17,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:17,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:36:17,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:17,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:36:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:36:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:36:17,206 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:36:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:17,676 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-08 14:36:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:36:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:36:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:36:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-04-08 14:36:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:36:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-04-08 14:36:17,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-04-08 14:36:17,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:17,728 INFO L225 Difference]: With dead ends: 62 [2022-04-08 14:36:17,728 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 14:36:17,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:36:17,729 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:17,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:36:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 14:36:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 14:36:17,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:17,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:36:17,757 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:36:17,757 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:36:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:17,759 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-08 14:36:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-08 14:36:17,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:17,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:17,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-08 14:36:17,760 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-08 14:36:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:17,761 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-08 14:36:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-08 14:36:17,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:17,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:17,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:17,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:36:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-04-08 14:36:17,763 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 40 [2022-04-08 14:36:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:17,763 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-04-08 14:36:17,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:36:17,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 63 transitions. [2022-04-08 14:36:17,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-08 14:36:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 14:36:17,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:17,824 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:17,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 14:36:18,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:18,048 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1748438349, now seen corresponding path program 3 times [2022-04-08 14:36:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:18,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078184175] [2022-04-08 14:36:18,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:18,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1748438349, now seen corresponding path program 4 times [2022-04-08 14:36:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:18,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770865367] [2022-04-08 14:36:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:18,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:18,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356479475] [2022-04-08 14:36:18,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:36:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:18,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:36:18,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:36:18,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:18,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:36:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:18,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:18,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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);~counter~0 := 0; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #66#return; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L272 TraceCheckUtils]: 13: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2826#true} {2826#true} #56#return; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {2826#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,435 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2826#true} {2826#true} #58#return; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2826#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L272 TraceCheckUtils]: 26: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-08 14:36:18,436 INFO L272 TraceCheckUtils]: 31: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {2826#true} ~cond := #in~cond; {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:18,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,438 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2826#true} #56#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:18,438 INFO L272 TraceCheckUtils]: 36: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,439 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2826#true} {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:18,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:18,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:18,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !(#t~post5 < 1);havoc #t~post5; {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-08 14:36:18,441 INFO L272 TraceCheckUtils]: 44: Hoare triple {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {2826#true} ~cond := #in~cond; {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:18,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {2927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,443 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2957#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #60#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:18,443 INFO L272 TraceCheckUtils]: 49: Hoare triple {2938#(= (+ (* 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)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:18,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:18,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-08 14:36:18,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-08 14:36:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 14:36:18,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:18,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-08 14:36:18,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-08 14:36:18,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:18,795 INFO L272 TraceCheckUtils]: 49: Hoare triple {2938#(= (+ (* 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)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:18,796 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #60#return; {2938#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-08 14:36:18,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {2826#true} ~cond := #in~cond; {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:18,797 INFO L272 TraceCheckUtils]: 44: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* 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)); {2826#true} is VALID [2022-04-08 14:36:18,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} assume !(#t~post5 < 1);havoc #t~post5; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:36:18,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:36:18,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:36:18,800 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2826#true} {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #58#return; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:36:18,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,801 INFO L272 TraceCheckUtils]: 36: Hoare triple {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,801 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} {2826#true} #56#return; {3005#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} is VALID [2022-04-08 14:36:18,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:36:18,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {2826#true} ~cond := #in~cond; {3015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:36:18,802 INFO L272 TraceCheckUtils]: 31: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,802 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-08 14:36:18,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L272 TraceCheckUtils]: 26: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2826#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2826#true} {2826#true} #58#return; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L272 TraceCheckUtils]: 18: Hoare triple {2826#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2826#true} {2826#true} #56#return; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L272 TraceCheckUtils]: 13: Hoare triple {2826#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2826#true} {2826#true} #54#return; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#true} assume !(0 == ~cond); {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} ~cond := #in~cond; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L272 TraceCheckUtils]: 8: Hoare triple {2826#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(#t~post5 < 1);havoc #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret6 := main(); {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #66#return; {2826#true} is VALID [2022-04-08 14:36:18,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-08 14:36:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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);~counter~0 := 0; {2826#true} is VALID [2022-04-08 14:36:18,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-08 14:36:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 14:36:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770865367] [2022-04-08 14:36:18,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356479475] [2022-04-08 14:36:18,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356479475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:36:18,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:36:18,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:36:18,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078184175] [2022-04-08 14:36:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078184175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:36:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092893201] [2022-04-08 14:36:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2022-04-08 14:36:18,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:18,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 14:36:18,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:18,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:36:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:36:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:36:18,837 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 14:36:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:19,244 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-08 14:36:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:36:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2022-04-08 14:36:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 14:36:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:36:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 14:36:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 14:36:19,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-08 14:36:19,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:19,271 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:36:19,271 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:36:19,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:36:19,272 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:19,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:36:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:36:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:36:19,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:19,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:36:19,272 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:36:19,272 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:36:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:19,273 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:36:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:19,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:19,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:19,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:36:19,273 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:36:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:19,273 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:36:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:19,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:19,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:19,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:19,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:36:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:36:19,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-08 14:36:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:19,274 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:36:19,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 14:36:19,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:36:19,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:36:19,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:19,276 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:36:19,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:19,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:19,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:19,925 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-08 14:36:19,926 INFO L878 garLoopResultBuilder]: At program point L33(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,926 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,926 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,926 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-08 14:36:19,926 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-08 14:36:19,927 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:19,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:36:19,927 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-08 14:36:19,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:36:19,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:36:19,927 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 14:36:19,928 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:36:19,928 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:36:19,928 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:36:19,928 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 14:36:19,928 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 14:36:19,930 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 14:36:19,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:36:19,933 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:36:19,934 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 14:36:19,935 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:36:19,935 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:36:19,935 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 14:36:19,938 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 14:36:19,945 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:36:19,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:36:19 BoogieIcfgContainer [2022-04-08 14:36:19,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:36:19,953 INFO L158 Benchmark]: Toolchain (without parser) took 20113.41ms. Allocated memory was 181.4MB in the beginning and 225.4MB in the end (delta: 44.0MB). Free memory was 132.1MB in the beginning and 153.1MB in the end (delta: -21.0MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-04-08 14:36:19,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 148.6MB in the beginning and 148.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:36:19,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 157.2MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:36:19,953 INFO L158 Benchmark]: Boogie Preprocessor took 34.22ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 14:36:19,953 INFO L158 Benchmark]: RCFGBuilder took 244.23ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 144.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 14:36:19,954 INFO L158 Benchmark]: TraceAbstraction took 19633.17ms. Allocated memory was 181.4MB in the beginning and 225.4MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 153.1MB in the end (delta: -9.1MB). Peak memory consumption was 115.5MB. Max. memory is 8.0GB. [2022-04-08 14:36:19,954 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 148.6MB in the beginning and 148.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 157.2MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.22ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.23ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 144.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19633.17ms. Allocated memory was 181.4MB in the beginning and 225.4MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 153.1MB in the end (delta: -9.1MB). Peak memory consumption was 115.5MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 662 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 598 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 236 mSDtfsCounter, 598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 316 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 182 PreInvPairs, 266 NumberOfFragments, 278 HoareAnnotationTreeSize, 182 FomulaSimplifications, 322 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 886 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: (s == t + a * a && t == a * 2 + 1) || !(\old(counter) == 0) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-08 14:36:19,969 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...