/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:39:38,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:39:38,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:39:39,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:39:39,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:39:39,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:39:39,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:39:39,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:39:39,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:39:39,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:39:39,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:39:39,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:39:39,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:39:39,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:39:39,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:39:39,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:39:39,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:39:39,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:39:39,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:39:39,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:39:39,060 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:39:39,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:39:39,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:39:39,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:39:39,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:39:39,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:39:39,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:39:39,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:39:39,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:39:39,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:39:39,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:39:39,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:39:39,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:39:39,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:39:39,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:39:39,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:39:39,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:39:39,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:39:39,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:39:39,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:39:39,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:39:39,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:39:39,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:39:39,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:39:39,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:39:39,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:39:39,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:39:39,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:39:39,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:39:39,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:39:39,089 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:39:39,089 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:39:39,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:39:39,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:39:39,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:39:39,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:39:39,315 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:39:39,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-28 14:39:39,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6515277/bf97ce419f2d4e829c9785b45e3d3991/FLAG820e7f10e [2022-04-28 14:39:39,700 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:39:39,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-28 14:39:39,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6515277/bf97ce419f2d4e829c9785b45e3d3991/FLAG820e7f10e [2022-04-28 14:39:40,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6515277/bf97ce419f2d4e829c9785b45e3d3991 [2022-04-28 14:39:40,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:39:40,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:39:40,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:39:40,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:39:40,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:39:40,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2f1fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40, skipping insertion in model container [2022-04-28 14:39:40,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:39:40,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:39:40,285 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_unwindbound2.c[520,533] [2022-04-28 14:39:40,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:39:40,304 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:39:40,312 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_unwindbound2.c[520,533] [2022-04-28 14:39:40,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:39:40,327 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:39:40,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40 WrapperNode [2022-04-28 14:39:40,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:39:40,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:39:40,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:39:40,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:39:40,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:39:40,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:39:40,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:39:40,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:39:40,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (1/1) ... [2022-04-28 14:39:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:39:40,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:40,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:39:40,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:39:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:39:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:39:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:39:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:39:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:39:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:39:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:39:40,449 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:39:40,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:39:40,538 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:39:40,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:39:40,543 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:39:40,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:39:40 BoogieIcfgContainer [2022-04-28 14:39:40,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:39:40,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:39:40,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:39:40,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:39:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:39:40" (1/3) ... [2022-04-28 14:39:40,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ddf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:39:40, skipping insertion in model container [2022-04-28 14:39:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:39:40" (2/3) ... [2022-04-28 14:39:40,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ddf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:39:40, skipping insertion in model container [2022-04-28 14:39:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:39:40" (3/3) ... [2022-04-28 14:39:40,563 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound2.c [2022-04-28 14:39:40,574 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:39:40,574 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:39:40,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:39:40,629 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4090164c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12952683 [2022-04-28 14:39:40,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:39:40,638 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-28 14:39:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 14:39:40,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:40,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:40,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 14:39:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:40,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44182469] [2022-04-28 14:39:40,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 14:39:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:40,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472098112] [2022-04-28 14:39:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:40,826 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-28 14:39:40,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:39:40,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:39:40,829 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-28 14:39:40,829 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-28 14:39:40,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 14:39:40,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 14:39:40,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 14:39:40,831 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-28 14:39:40,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 14:39:40,832 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-28 14:39:40,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 14:39:40,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 14:39:40,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 14:39:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:40,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472098112] [2022-04-28 14:39:40,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472098112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:40,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:40,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:39:40,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44182469] [2022-04-28 14:39:40,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44182469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:40,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:39:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661968993] [2022-04-28 14:39:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:40,845 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-28 14:39:40,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:40,848 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-28 14:39:40,863 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-28 14:39:40,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:39:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:39:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:39:40,893 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-28 14:39:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,053 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 14:39:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:39:41,053 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-28 14:39:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:41,054 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-28 14:39:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:39:41,060 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-28 14:39:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 14:39:41,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 14:39:41,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:41,132 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:39:41,133 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 14:39:41,135 INFO L412 NwaCegarLoop]: 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-28 14:39:41,138 INFO L413 NwaCegarLoop]: 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-28 14:39:41,140 INFO L414 NwaCegarLoop]: 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-28 14:39:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 14:39:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 14:39:41,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:41,167 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-28 14:39:41,168 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-28 14:39:41,168 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-28 14:39:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,172 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:39:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:39:41,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:41,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:41,173 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-28 14:39:41,173 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-28 14:39:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,182 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 14:39:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 14:39:41,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:41,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:41,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:41,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:41,183 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-28 14:39:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 14:39:41,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 14:39:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:41,186 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 14:39:41,186 INFO L496 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-28 14:39:41,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 14:39:41,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 14:39:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:39:41,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:41,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:41,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:39:41,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 14:39:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:41,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877259438] [2022-04-28 14:39:41,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 14:39:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:41,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647814477] [2022-04-28 14:39:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:41,308 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-28 14:39:41,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:41,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:41,310 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-28 14:39:41,311 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-28 14:39:41,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:41,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:41,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 14:39:41,312 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-28 14:39:41,313 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-28 14:39:41,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {218#false} is VALID [2022-04-28 14:39:41,313 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-28 14:39:41,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 14:39:41,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 14:39:41,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 14:39:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:41,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647814477] [2022-04-28 14:39:41,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647814477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:41,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:41,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:39:41,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877259438] [2022-04-28 14:39:41,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877259438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:41,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:41,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:39:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443589067] [2022-04-28 14:39:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:41,316 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-28 14:39:41,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:41,317 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-28 14:39:41,325 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-28 14:39:41,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:41,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:41,327 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-28 14:39:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,469 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 14:39:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:39:41,469 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-28 14:39:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:41,470 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-28 14:39:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:39:41,475 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-28 14:39:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:39:41,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 14:39:41,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:41,521 INFO L225 Difference]: With dead ends: 32 [2022-04-28 14:39:41,521 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:39:41,522 INFO L412 NwaCegarLoop]: 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-28 14:39:41,524 INFO L413 NwaCegarLoop]: 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-28 14:39:41,525 INFO L414 NwaCegarLoop]: 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-28 14:39:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:39:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:39:41,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:41,546 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-28 14:39:41,546 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-28 14:39:41,547 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-28 14:39:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,550 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:39:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:41,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:41,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:41,552 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-28 14:39:41,552 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-28 14:39:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:41,555 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 14:39:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:41,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:41,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:41,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:41,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:41,557 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-28 14:39:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 14:39:41,559 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 14:39:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:41,559 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 14:39:41,559 INFO L496 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-28 14:39:41,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 14:39:41,591 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-28 14:39:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 14:39:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:39:41,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:41,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:39:41,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 14:39:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:41,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260673296] [2022-04-28 14:39:41,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 14:39:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:41,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188977278] [2022-04-28 14:39:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:39:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:41,693 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-28 14:39:41,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:39:41,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:39:41,695 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-28 14:39:41,695 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-28 14:39:41,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 14:39:41,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 14:39:41,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 14:39:41,696 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-28 14:39:41,697 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-28 14:39:41,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 2);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 14:39:41,702 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-28 14:39:41,703 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-28 14:39:41,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 14:39:41,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 14:39:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:41,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:41,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188977278] [2022-04-28 14:39:41,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188977278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:41,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:41,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:39:41,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:41,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260673296] [2022-04-28 14:39:41,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260673296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:41,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:41,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:39:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449362468] [2022-04-28 14:39:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:41,707 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-28 14:39:41,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:41,707 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-28 14:39:41,716 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-28 14:39:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:39:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:39:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:41,717 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-28 14:39:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,021 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 14:39:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:39:42,021 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-28 14:39:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:42,022 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-28 14:39:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:39:42,023 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-28 14:39:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 14:39:42,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 14:39:42,079 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-28 14:39:42,080 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:39:42,081 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:39:42,082 INFO L412 NwaCegarLoop]: 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-28 14:39:42,084 INFO L413 NwaCegarLoop]: 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-28 14:39:42,086 INFO L414 NwaCegarLoop]: 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-28 14:39:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:39:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 14:39:42,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:42,093 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-28 14:39:42,093 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-28 14:39:42,093 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-28 14:39:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,095 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:39:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:39:42,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:42,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:42,096 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-28 14:39:42,096 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-28 14:39:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,098 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 14:39:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 14:39:42,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:42,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:42,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:42,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:42,099 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-28 14:39:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 14:39:42,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 14:39:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:42,100 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 14:39:42,100 INFO L496 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-28 14:39:42,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 14:39:42,140 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-28 14:39:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 14:39:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:39:42,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:42,141 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:42,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:39:42,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 14:39:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:42,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168416857] [2022-04-28 14:39:42,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 14:39:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860871159] [2022-04-28 14:39:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:42,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656498805] [2022-04-28 14:39:42,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:42,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:42,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:39:42,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:42,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:42,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:42,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 14:39:42,399 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-28 14:39:42,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:39:42,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 14:39:42,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 14:39:42,403 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-28 14:39:42,404 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-28 14:39:42,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 14:39:42,404 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-28 14:39:42,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 14:39:42,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 14:39:42,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 14:39:42,407 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-28 14:39:42,408 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-28 14:39:42,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:42,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 14:39:42,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 14:39:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:39:42,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:39:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860871159] [2022-04-28 14:39:42,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:42,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656498805] [2022-04-28 14:39:42,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656498805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:42,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:42,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:42,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:42,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168416857] [2022-04-28 14:39:42,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168416857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:42,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:42,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969984695] [2022-04-28 14:39:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:42,413 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-28 14:39:42,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:42,413 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-28 14:39:42,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:42,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:42,427 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-28 14:39:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,547 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 14:39:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:42,547 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-28 14:39:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:42,548 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-28 14:39:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:42,549 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-28 14:39:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:42,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:39:42,581 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-28 14:39:42,582 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:39:42,583 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:39:42,583 INFO L412 NwaCegarLoop]: 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-28 14:39:42,583 INFO L413 NwaCegarLoop]: 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-28 14:39:42,584 INFO L414 NwaCegarLoop]: 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-28 14:39:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:39:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 14:39:42,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:42,593 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-28 14:39:42,593 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-28 14:39:42,593 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-28 14:39:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,595 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:39:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:39:42,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:42,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:42,596 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-28 14:39:42,596 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-28 14:39:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:42,597 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 14:39:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 14:39:42,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:42,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:42,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:42,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:42,598 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-28 14:39:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 14:39:42,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 14:39:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:42,600 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 14:39:42,600 INFO L496 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-28 14:39:42,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 14:39:42,634 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-28 14:39:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 14:39:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:39:42,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:42,634 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:42,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:42,851 WARN L477 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-28 14:39:42,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 14:39:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504201353] [2022-04-28 14:39:42,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:39:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 14:39:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:42,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194610980] [2022-04-28 14:39:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:42,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:42,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081967226] [2022-04-28 14:39:42,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:42,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:42,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:39:42,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:42,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:42,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:42,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:43,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 14:39:43,007 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-28 14:39:43,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:43,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 14:39:43,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 14:39:43,008 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-28 14:39:43,008 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-28 14:39:43,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 14:39:43,009 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-28 14:39:43,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:39:43,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:39:43,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:43,010 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-28 14:39:43,010 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-28 14:39:43,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 14:39:43,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 14:39:43,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 14:39:43,011 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-28 14:39:43,012 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-28 14:39:43,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:43,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 14:39:43,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 14:39:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:39:43,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:39:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194610980] [2022-04-28 14:39:43,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081967226] [2022-04-28 14:39:43,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081967226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:43,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:43,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:43,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504201353] [2022-04-28 14:39:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504201353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:43,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:43,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40877461] [2022-04-28 14:39:43,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:43,014 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-28 14:39:43,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:43,014 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-28 14:39:43,026 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-28 14:39:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:43,027 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-28 14:39:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:43,143 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 14:39:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:43,144 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-28 14:39:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:43,144 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-28 14:39:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:43,146 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-28 14:39:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 14:39:43,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 14:39:43,175 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-28 14:39:43,178 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:39:43,178 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 14:39:43,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:43,180 INFO L413 NwaCegarLoop]: 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-28 14:39:43,180 INFO L414 NwaCegarLoop]: 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-28 14:39:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 14:39:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 14:39:43,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:43,194 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-28 14:39:43,195 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-28 14:39:43,195 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-28 14:39:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:43,198 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:39:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:43,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:43,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:43,199 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-28 14:39:43,200 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-28 14:39:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:43,203 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 14:39:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:43,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:43,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:43,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:43,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:43,203 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-28 14:39:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 14:39:43,204 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 14:39:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:43,205 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 14:39:43,205 INFO L496 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-28 14:39:43,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 14:39:43,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:39:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:39:43,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:43,241 INFO L195 NwaCegarLoop]: 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-28 14:39:43,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:43,458 WARN L477 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-28 14:39:43,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 14:39:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:43,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118275198] [2022-04-28 14:39:43,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:43,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 2 times [2022-04-28 14:39:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:43,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223692989] [2022-04-28 14:39:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:43,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584739786] [2022-04-28 14:39:43,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:43,723 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:43,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:39:43,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:43,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:43,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:39:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:43,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:43,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:39:43,892 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; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:43,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(<= ~counter~0 0)} assume true; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:43,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(<= ~counter~0 0)} {1211#true} #66#return; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:43,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(<= ~counter~0 0)} call #t~ret6 := main(); {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:43,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(<= ~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; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:43,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,896 INFO L272 TraceCheckUtils]: 8: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,897 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #54#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,898 INFO L272 TraceCheckUtils]: 13: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,899 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #56#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,902 INFO L272 TraceCheckUtils]: 18: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {1235#(<= ~counter~0 1)} ~cond := #in~cond; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {1235#(<= ~counter~0 1)} assume !(0 == ~cond); {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= ~counter~0 1)} assume true; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,903 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1235#(<= ~counter~0 1)} {1235#(<= ~counter~0 1)} #58#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:43,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1290#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:39:43,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1290#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1212#false} is VALID [2022-04-28 14:39:43,905 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-28 14:39:43,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-28 14:39:43,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:39:43,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:39:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:43,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:44,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 14:39:44,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 14:39:44,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2022-04-28 14:39:44,029 INFO L272 TraceCheckUtils]: 26: Hoare triple {1212#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1212#false} is VALID [2022-04-28 14:39:44,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {1290#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1212#false} is VALID [2022-04-28 14:39:44,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1290#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:39:44,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,040 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1211#true} {1235#(<= ~counter~0 1)} #58#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:44,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:44,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:44,040 INFO L272 TraceCheckUtils]: 18: Hoare triple {1235#(<= ~counter~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-28 14:39:44,041 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1211#true} {1235#(<= ~counter~0 1)} #56#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:44,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:44,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:44,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1211#true} is VALID [2022-04-28 14:39:44,042 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1235#(<= ~counter~0 1)} #54#return; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 14:39:44,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 14:39:44,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 14:39:44,042 INFO L272 TraceCheckUtils]: 8: Hoare triple {1235#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 14:39:44,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1235#(<= ~counter~0 1)} is VALID [2022-04-28 14:39:44,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(<= ~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; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:44,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(<= ~counter~0 0)} call #t~ret6 := main(); {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:44,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(<= ~counter~0 0)} {1211#true} #66#return; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:44,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(<= ~counter~0 0)} assume true; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:44,045 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; {1219#(<= ~counter~0 0)} is VALID [2022-04-28 14:39:44,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 14:39:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:44,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223692989] [2022-04-28 14:39:44,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:44,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584739786] [2022-04-28 14:39:44,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584739786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:39:44,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:39:44,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 14:39:44,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118275198] [2022-04-28 14:39:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118275198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:44,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:44,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94328364] [2022-04-28 14:39:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 14:39:44,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:44,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:44,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:39:44,063 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:44,158 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 14:39:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:39:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 14:39:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 14:39:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-28 14:39:44,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-28 14:39:44,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:44,195 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:39:44,195 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:39:44,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:39:44,196 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:44,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:39:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 14:39:44,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:44,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 14:39:44,220 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 14:39:44,220 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 14:39:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:44,221 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 14:39:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:44,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:44,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:44,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-28 14:39:44,222 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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 41 states. [2022-04-28 14:39:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:44,223 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-28 14:39:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:44,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:44,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:44,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-28 14:39:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-28 14:39:44,224 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-28 14:39:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:44,225 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-28 14:39:44,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 47 transitions. [2022-04-28 14:39:44,261 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-28 14:39:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-28 14:39:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:39:44,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:44,262 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:44,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:44,475 WARN L477 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-28 14:39:44,476 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-28 14:39:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:44,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145821466] [2022-04-28 14:39:44,647 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:44,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 2 times [2022-04-28 14:39:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:44,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777460436] [2022-04-28 14:39:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:44,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140612485] [2022-04-28 14:39:44,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:39:44,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:44,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:44,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:44,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:39:44,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:39:44,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:44,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:39:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:44,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-28 14:39:44,829 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-28 14:39:44,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-28 14:39:44,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-28 14:39:44,830 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))} is VALID [2022-04-28 14:39:44,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:39:44,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1681#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:39:44,830 INFO L272 TraceCheckUtils]: 8: Hoare triple {1681#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:39:44,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:39:44,831 INFO L272 TraceCheckUtils]: 13: Hoare triple {1681#(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)); {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,832 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:39:44,832 INFO L272 TraceCheckUtils]: 18: Hoare triple {1681#(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)); {1661#true} is VALID [2022-04-28 14:39:44,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,833 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1681#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1681#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 14:39:44,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {1681#(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; {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-28 14:39:44,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-28 14:39:44,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} is VALID [2022-04-28 14:39:44,834 INFO L272 TraceCheckUtils]: 26: Hoare triple {1736#(and (= (+ (- 2) main_~t~0) 1) (= main_~a~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:44,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:44,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-28 14:39:44,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-28 14:39:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:44,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:44,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2022-04-28 14:39:44,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1662#false} is VALID [2022-04-28 14:39:44,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:44,954 INFO L272 TraceCheckUtils]: 26: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:44,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {1766#(= 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; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,955 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1661#true} {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,956 INFO L272 TraceCheckUtils]: 18: Hoare triple {1766#(= 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)); {1661#true} is VALID [2022-04-28 14:39:44,959 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1661#true} {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,959 INFO L272 TraceCheckUtils]: 13: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1661#true} is VALID [2022-04-28 14:39:44,960 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1661#true} {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#true} assume !(0 == ~cond); {1661#true} is VALID [2022-04-28 14:39:44,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#true} ~cond := #in~cond; {1661#true} is VALID [2022-04-28 14:39:44,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1661#true} is VALID [2022-04-28 14:39:44,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,961 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; {1766#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-28 14:39:44,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret6 := main(); {1661#true} is VALID [2022-04-28 14:39:44,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #66#return; {1661#true} is VALID [2022-04-28 14:39:44,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2022-04-28 14:39:44,962 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-28 14:39:44,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2022-04-28 14:39:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 14:39:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777460436] [2022-04-28 14:39:44,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140612485] [2022-04-28 14:39:44,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140612485] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:39:44,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:39:44,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:39:44,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:44,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145821466] [2022-04-28 14:39:44,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145821466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:44,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:44,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:39:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666548591] [2022-04-28 14:39:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:44,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 14:39:44,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:44,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:44,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:39:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:39:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:39:44,979 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:45,098 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 14:39:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-28 14:39:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:39:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:39:45,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:39:45,122 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-28 14:39:45,123 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:39:45,123 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:39:45,123 INFO L412 NwaCegarLoop]: 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-28 14:39:45,124 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:45,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:39:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:39:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 14:39:45,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:45,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-28 14:39:45,151 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-28 14:39:45,152 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-28 14:39:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:45,153 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:45,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:45,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:45,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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 45 states. [2022-04-28 14:39:45,153 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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 45 states. [2022-04-28 14:39:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:45,154 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:45,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:45,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:45,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:45,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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-28 14:39:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-28 14:39:45,156 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-28 14:39:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:45,156 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-28 14:39:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:39:45,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-28 14:39:45,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 14:39:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:39:45,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:39:45,196 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:39:45,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 14:39:45,412 WARN L477 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-28 14:39:45,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:39:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:39:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 3 times [2022-04-28 14:39:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95267124] [2022-04-28 14:39:45,562 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:39:45,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:39:45,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 4 times [2022-04-28 14:39:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:39:45,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429335652] [2022-04-28 14:39:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:39:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:39:45,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:39:45,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526579947] [2022-04-28 14:39:45,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:39:45,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:39:45,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:39:45,590 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:39:45,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:39:45,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:39:45,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:39:45,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:39:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:39:45,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:39:45,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {2123#true} call ULTIMATE.init(); {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {2123#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; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2123#true} {2123#true} #66#return; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {2123#true} call #t~ret6 := main(); {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {2123#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; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {2123#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {2123#true} assume !!(#t~post5 < 2);havoc #t~post5; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {2123#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2123#true} ~cond := #in~cond; {2123#true} is VALID [2022-04-28 14:39:45,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {2123#true} assume !(0 == ~cond); {2123#true} is VALID [2022-04-28 14:39:45,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:45,803 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2123#true} {2123#true} #54#return; {2123#true} is VALID [2022-04-28 14:39:45,803 INFO L272 TraceCheckUtils]: 13: Hoare triple {2123#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2123#true} is VALID [2022-04-28 14:39:45,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {2123#true} ~cond := #in~cond; {2170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:45,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {2170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:45,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:45,805 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} {2123#true} #56#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:45,805 INFO L272 TraceCheckUtils]: 18: Hoare triple {2181#(= (+ (* 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)); {2123#true} is VALID [2022-04-28 14:39:45,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {2123#true} ~cond := #in~cond; {2123#true} is VALID [2022-04-28 14:39:45,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {2123#true} assume !(0 == ~cond); {2123#true} is VALID [2022-04-28 14:39:45,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:45,805 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2123#true} {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:45,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {2181#(= (+ (* 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; {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:45,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:45,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !!(#t~post5 < 2);havoc #t~post5; {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2022-04-28 14:39:45,808 INFO L272 TraceCheckUtils]: 26: Hoare triple {2200#(= 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)); {2123#true} is VALID [2022-04-28 14:39:45,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {2123#true} ~cond := #in~cond; {2170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:45,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {2170#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:45,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:45,810 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} {2200#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #54#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:45,810 INFO L272 TraceCheckUtils]: 31: Hoare triple {2181#(= (+ (* 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)); {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:45,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:45,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {2229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2124#false} is VALID [2022-04-28 14:39:45,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {2124#false} assume !false; {2124#false} is VALID [2022-04-28 14:39:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:45,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:39:46,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {2124#false} assume !false; {2124#false} is VALID [2022-04-28 14:39:46,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {2229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2124#false} is VALID [2022-04-28 14:39:46,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:39:46,115 INFO L272 TraceCheckUtils]: 31: Hoare triple {2181#(= (+ (* 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)); {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:39:46,115 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} {2248#(or (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0))} #54#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:46,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:46,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {2258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:46,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {2123#true} ~cond := #in~cond; {2258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:39:46,119 INFO L272 TraceCheckUtils]: 26: Hoare triple {2248#(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)); {2123#true} is VALID [2022-04-28 14:39:46,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(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 < 2);havoc #t~post5; {2248#(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-28 14:39:46,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(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; {2248#(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-28 14:39:46,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {2181#(= (+ (* 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; {2248#(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-28 14:39:46,131 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2123#true} {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:46,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:46,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {2123#true} assume !(0 == ~cond); {2123#true} is VALID [2022-04-28 14:39:46,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {2123#true} ~cond := #in~cond; {2123#true} is VALID [2022-04-28 14:39:46,132 INFO L272 TraceCheckUtils]: 18: Hoare triple {2181#(= (+ (* 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)); {2123#true} is VALID [2022-04-28 14:39:46,138 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} {2123#true} #56#return; {2181#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-28 14:39:46,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:46,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {2258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {2123#true} ~cond := #in~cond; {2258#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 14:39:46,140 INFO L272 TraceCheckUtils]: 13: Hoare triple {2123#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2123#true} {2123#true} #54#return; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {2123#true} assume !(0 == ~cond); {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {2123#true} ~cond := #in~cond; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L272 TraceCheckUtils]: 8: Hoare triple {2123#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {2123#true} assume !!(#t~post5 < 2);havoc #t~post5; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {2123#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {2123#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; {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {2123#true} call #t~ret6 := main(); {2123#true} is VALID [2022-04-28 14:39:46,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2123#true} {2123#true} #66#return; {2123#true} is VALID [2022-04-28 14:39:46,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {2123#true} assume true; {2123#true} is VALID [2022-04-28 14:39:46,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {2123#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; {2123#true} is VALID [2022-04-28 14:39:46,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {2123#true} call ULTIMATE.init(); {2123#true} is VALID [2022-04-28 14:39:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:39:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:39:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429335652] [2022-04-28 14:39:46,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:39:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526579947] [2022-04-28 14:39:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526579947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:39:46,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:39:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:39:46,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:39:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95267124] [2022-04-28 14:39:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95267124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:39:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:39:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:39:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660498829] [2022-04-28 14:39:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:39:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-28 14:39:46,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:39:46,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:39:46,160 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-28 14:39:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:39:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:39:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:39:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:39:46,162 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:39:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:46,539 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:39:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:39:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-28 14:39:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:39:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:39:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:39:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 14:39:46,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 14:39:46,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:46,571 INFO L225 Difference]: With dead ends: 45 [2022-04-28 14:39:46,571 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:39:46,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:39:46,572 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:39:46,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:39:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:39:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:39:46,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:39:46,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:46,573 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:46,573 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:46,573 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:46,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:46,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:46,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:46,573 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:39:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:39:46,573 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:39:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:46,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:46,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:39:46,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:39:46,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:39:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:39:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:39:46,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-28 14:39:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:39:46,574 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:39:46,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:39:46,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:39:46,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:39:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:39:46,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:39:46,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:39:46,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:39:46,788 WARN L477 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-28 14:39:46,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-28 14:39:47,177 INFO L895 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-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:47,178 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 14:39:47,178 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 49) the Hoare annotation is: true [2022-04-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= main_~t~0 1) (= main_~s~0 1)) (and (= main_~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-28 14:39:47,178 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:47,178 INFO L895 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-28 14:39:47,178 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:47,178 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:39:47,178 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-28 14:39:47,178 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:39:47,179 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:39:47,179 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:39:47,179 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:47,179 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:47,179 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:47,179 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 14:39:47,179 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 14:39:47,181 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-28 14:39:47,182 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:39:47,184 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:39:47,188 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:39:47,188 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:39:47,189 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:47,189 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 14:39:47,191 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 14:39:47,197 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-28 14:39:47,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:39:47 BoogieIcfgContainer [2022-04-28 14:39:47,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:39:47,212 INFO L158 Benchmark]: Toolchain (without parser) took 7070.54ms. Allocated memory was 185.6MB in the beginning and 273.7MB in the end (delta: 88.1MB). Free memory was 134.2MB in the beginning and 105.7MB in the end (delta: 28.5MB). Peak memory consumption was 117.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:47,212 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:39:47,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.15ms. Allocated memory is still 185.6MB. Free memory was 134.0MB in the beginning and 159.0MB in the end (delta: -25.0MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-28 14:39:47,213 INFO L158 Benchmark]: Boogie Preprocessor took 20.45ms. Allocated memory is still 185.6MB. Free memory was 159.0MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:39:47,213 INFO L158 Benchmark]: RCFGBuilder took 195.27ms. Allocated memory is still 185.6MB. Free memory was 157.5MB in the beginning and 146.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:39:47,213 INFO L158 Benchmark]: TraceAbstraction took 6665.48ms. Allocated memory was 185.6MB in the beginning and 273.7MB in the end (delta: 88.1MB). Free memory was 146.0MB in the beginning and 105.7MB in the end (delta: 40.3MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. [2022-04-28 14:39:47,215 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.13ms. Allocated memory is still 185.6MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.15ms. Allocated memory is still 185.6MB. Free memory was 134.0MB in the beginning and 159.0MB in the end (delta: -25.0MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.45ms. Allocated memory is still 185.6MB. Free memory was 159.0MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 195.27ms. Allocated memory is still 185.6MB. Free memory was 157.5MB in the beginning and 146.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6665.48ms. Allocated memory was 185.6MB in the beginning and 273.7MB in the end (delta: 88.1MB). Free memory was 146.0MB in the beginning and 105.7MB in the end (delta: 40.3MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 516 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 209 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 206 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 164 PreInvPairs, 227 NumberOfFragments, 278 HoareAnnotationTreeSize, 164 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 816 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-28 14:39:47,243 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...