/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:12:33,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:12:33,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:12:33,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:12:33,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:12:33,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:12:33,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:12:33,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:12:33,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:12:33,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:12:33,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:12:33,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:12:33,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:12:33,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:12:33,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:12:33,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:12:33,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:12:33,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:12:33,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:12:33,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:12:33,248 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:12:33,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:12:33,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:12:33,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:12:33,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:12:33,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:12:33,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:12:33,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:12:33,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:12:33,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:12:33,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:12:33,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:12:33,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:12:33,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:12:33,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:12:33,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:12:33,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:12:33,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:12:33,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:12:33,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:12:33,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:12:33,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:12:33,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:12:33,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:12:33,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:12:33,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:12:33,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:12:33,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:12:33,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:33,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:12:33,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:12:33,276 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:12:33,276 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:12:33,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:12:33,276 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:12:33,276 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 03:12:33,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:12:33,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:12:33,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:12:33,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:12:33,572 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:12:33,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2022-04-28 03:12:33,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dccac1a/e59283bda5ba4b058d99dcda616b53da/FLAGf00009a30 [2022-04-28 03:12:33,985 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:12:33,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2022-04-28 03:12:33,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dccac1a/e59283bda5ba4b058d99dcda616b53da/FLAGf00009a30 [2022-04-28 03:12:33,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dccac1a/e59283bda5ba4b058d99dcda616b53da [2022-04-28 03:12:33,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:12:34,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:12:34,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:34,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:12:34,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:12:34,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:33" (1/1) ... [2022-04-28 03:12:34,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d367762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34, skipping insertion in model container [2022-04-28 03:12:34,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:33" (1/1) ... [2022-04-28 03:12:34,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:12:34,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:12:34,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i[895,908] [2022-04-28 03:12:34,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:34,162 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:12:34,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i[895,908] [2022-04-28 03:12:34,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:34,181 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:12:34,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34 WrapperNode [2022-04-28 03:12:34,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:34,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:12:34,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:12:34,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:12:34,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:12:34,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:12:34,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:12:34,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:12:34,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (1/1) ... [2022-04-28 03:12:34,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:34,251 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 03:12:34,271 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 03:12:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:12:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:12:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:12:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:12:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:12:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:12:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:12:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:12:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:12:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:12:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:12:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:12:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:12:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:12:34,335 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:12:34,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:12:34,421 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:12:34,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:12:34,426 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:12:34,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:34 BoogieIcfgContainer [2022-04-28 03:12:34,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:12:34,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:12:34,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:12:34,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:12:34,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:12:33" (1/3) ... [2022-04-28 03:12:34,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52356585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:34, skipping insertion in model container [2022-04-28 03:12:34,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:34" (2/3) ... [2022-04-28 03:12:34,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52356585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:34, skipping insertion in model container [2022-04-28 03:12:34,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:34" (3/3) ... [2022-04-28 03:12:34,432 INFO L111 eAbstractionObserver]: Analyzing ICFG gr2006.i [2022-04-28 03:12:34,441 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:12:34,441 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:12:34,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:12:34,500 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@46b3778b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30b3f1c7 [2022-04-28 03:12:34,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:12:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:12:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:12:34,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:34,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:34,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1795296022, now seen corresponding path program 1 times [2022-04-28 03:12:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075427892] [2022-04-28 03:12:34,555 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1795296022, now seen corresponding path program 2 times [2022-04-28 03:12:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:34,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413108221] [2022-04-28 03:12:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:34,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-28 03:12:34,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:12:34,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #61#return; {24#true} is VALID [2022-04-28 03:12:34,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:34,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-28 03:12:34,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:12:34,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #61#return; {24#true} is VALID [2022-04-28 03:12:34,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2022-04-28 03:12:34,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24#true} is VALID [2022-04-28 03:12:34,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:12:34,721 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25#false} is VALID [2022-04-28 03:12:34,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:12:34,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:12:34,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:12:34,724 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 03:12:34,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:34,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413108221] [2022-04-28 03:12:34,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413108221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:34,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:34,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:34,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075427892] [2022-04-28 03:12:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075427892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:34,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:34,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564842095] [2022-04-28 03:12:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:34,736 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 03:12:34,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:34,739 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 03:12:34,760 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 03:12:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:12:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:12:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:12:34,787 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 03:12:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:34,854 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 03:12:34,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:12:34,854 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 03:12:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:34,855 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 03:12:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-28 03:12:34,860 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 03:12:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-28 03:12:34,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-28 03:12:34,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:34,923 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:12:34,924 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:12:34,930 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 03:12:34,932 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:34,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:12:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:12:34,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:34,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 03:12:34,964 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 03:12:34,964 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 03:12:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:34,970 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 03:12:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:12:34,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:34,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:34,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand 14 states. [2022-04-28 03:12:34,971 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand 14 states. [2022-04-28 03:12:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:34,973 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 03:12:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:12:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:34,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:34,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 03:12:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 03:12:34,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 03:12:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:34,981 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 03:12:34,984 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 03:12:34,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 03:12:35,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 03:12:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:12:35,000 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:35,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:35,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:12:35,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1744532035, now seen corresponding path program 1 times [2022-04-28 03:12:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326410252] [2022-04-28 03:12:35,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1744532035, now seen corresponding path program 2 times [2022-04-28 03:12:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:35,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297233972] [2022-04-28 03:12:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {154#true} is VALID [2022-04-28 03:12:35,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:12:35,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #61#return; {154#true} is VALID [2022-04-28 03:12:35,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:35,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {154#true} is VALID [2022-04-28 03:12:35,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:12:35,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #61#return; {154#true} is VALID [2022-04-28 03:12:35,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret4 := main(); {154#true} is VALID [2022-04-28 03:12:35,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {159#(= main_~y~0 0)} is VALID [2022-04-28 03:12:35,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~y~0 0)} assume !false; {159#(= main_~y~0 0)} is VALID [2022-04-28 03:12:35,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(= main_~y~0 0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {160#(<= 1 main_~y~0)} is VALID [2022-04-28 03:12:35,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(<= 1 main_~y~0)} assume ~y~0 < 0; {155#false} is VALID [2022-04-28 03:12:35,069 INFO L272 TraceCheckUtils]: 9: Hoare triple {155#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {155#false} is VALID [2022-04-28 03:12:35,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} ~cond := #in~cond; {155#false} is VALID [2022-04-28 03:12:35,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume 0 == ~cond; {155#false} is VALID [2022-04-28 03:12:35,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-28 03:12:35,070 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 03:12:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:35,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297233972] [2022-04-28 03:12:35,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297233972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:12:35,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326410252] [2022-04-28 03:12:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326410252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:12:35,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071230253] [2022-04-28 03:12:35,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-28 03:12:35,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:35,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:12:35,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:12:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:12:35,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:12:35,085 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:12:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,210 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 03:12:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:12:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-28 03:12:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:12:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 03:12:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:12:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 03:12:35,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 03:12:35,238 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 03:12:35,240 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:12:35,240 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:12:35,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:12:35,243 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:35,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:12:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-28 03:12:35,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:35,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 03:12:35,249 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 03:12:35,250 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 03:12:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,251 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:12:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:12:35,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) Second operand 19 states. [2022-04-28 03:12:35,251 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) Second operand 19 states. [2022-04-28 03:12:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,252 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:12:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:12:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:35,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 03:12:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:12:35,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:12:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:35,254 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:12:35,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:12:35,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:12:35,269 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 03:12:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:12:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:12:35,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:35,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:35,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:12:35,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1801790337, now seen corresponding path program 1 times [2022-04-28 03:12:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820544146] [2022-04-28 03:12:35,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1801790337, now seen corresponding path program 2 times [2022-04-28 03:12:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254864246] [2022-04-28 03:12:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {288#true} is VALID [2022-04-28 03:12:35,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-28 03:12:35,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {288#true} {288#true} #61#return; {288#true} is VALID [2022-04-28 03:12:35,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:35,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {288#true} is VALID [2022-04-28 03:12:35,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-28 03:12:35,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #61#return; {288#true} is VALID [2022-04-28 03:12:35,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret4 := main(); {288#true} is VALID [2022-04-28 03:12:35,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {293#(= main_~x~0 0)} is VALID [2022-04-28 03:12:35,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(= main_~x~0 0)} assume !false; {293#(= main_~x~0 0)} is VALID [2022-04-28 03:12:35,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(= main_~x~0 0)} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {289#false} is VALID [2022-04-28 03:12:35,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#false} assume ~y~0 < 0; {289#false} is VALID [2022-04-28 03:12:35,342 INFO L272 TraceCheckUtils]: 9: Hoare triple {289#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {289#false} is VALID [2022-04-28 03:12:35,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2022-04-28 03:12:35,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2022-04-28 03:12:35,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-28 03:12:35,342 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 03:12:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254864246] [2022-04-28 03:12:35,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254864246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:35,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:35,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820544146] [2022-04-28 03:12:35,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820544146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:35,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47886995] [2022-04-28 03:12:35,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 03:12:35,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:35,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 03:12:35,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:12:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:12:35,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:12:35,354 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 03:12:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,396 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 03:12:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:12:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 03:12:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 03:12:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 03:12:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 03:12:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 03:12:35,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 03:12:35,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,420 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:12:35,420 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:12:35,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:12:35,421 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:35,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:12:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 03:12:35,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:35,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 03:12:35,428 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 03:12:35,428 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 03:12:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,429 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:12:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:12:35,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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) Second operand 20 states. [2022-04-28 03:12:35,430 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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) Second operand 20 states. [2022-04-28 03:12:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:35,431 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:12:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:12:35,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:35,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:35,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:35,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 03:12:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 03:12:35,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2022-04-28 03:12:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:35,433 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 03:12:35,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 03:12:35,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 03:12:35,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:12:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:12:35,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:35,451 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:35,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:12:35,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 799073317, now seen corresponding path program 1 times [2022-04-28 03:12:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069160560] [2022-04-28 03:12:35,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:35,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -677716756, now seen corresponding path program 1 times [2022-04-28 03:12:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:35,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153438448] [2022-04-28 03:12:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:35,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {433#true} is VALID [2022-04-28 03:12:35,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#true} assume true; {433#true} is VALID [2022-04-28 03:12:35,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {433#true} {433#true} #61#return; {433#true} is VALID [2022-04-28 03:12:35,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {433#true} call ULTIMATE.init(); {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:35,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {433#true} is VALID [2022-04-28 03:12:35,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#true} assume true; {433#true} is VALID [2022-04-28 03:12:35,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {433#true} {433#true} #61#return; {433#true} is VALID [2022-04-28 03:12:35,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {433#true} call #t~ret4 := main(); {433#true} is VALID [2022-04-28 03:12:35,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {438#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:35,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#(and (= main_~x~0 0) (= main_~y~0 0))} [65] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_11 1))) (.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse2 (= |v_main_#t~post1_4| |v_main_#t~post1_3|)) (.cse3 (= v_main_~y~0_11 v_main_~y~0_10))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_11 50)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_11 v_main_~y~0_10))) (and (< v_main_~y~0_11 v_main_~y~0_10) (= (+ v_main_~x~0_10 v_main_~y~0_11) .cse5) (< .cse5 (+ v_main_~y~0_11 51)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_11, main_#t~post1=|v_main_#t~post1_4|} OutVars{main_~y~0=v_main_~y~0_10, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_10, main_#t~post1=|v_main_#t~post1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:12:35,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} [64] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:12:35,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {440#(and (<= 49 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-28 03:12:35,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {440#(and (<= 49 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {434#false} is VALID [2022-04-28 03:12:35,843 INFO L272 TraceCheckUtils]: 10: Hoare triple {434#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {434#false} is VALID [2022-04-28 03:12:35,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#false} ~cond := #in~cond; {434#false} is VALID [2022-04-28 03:12:35,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#false} assume 0 == ~cond; {434#false} is VALID [2022-04-28 03:12:35,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#false} assume !false; {434#false} is VALID [2022-04-28 03:12:35,843 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 03:12:35,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:35,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153438448] [2022-04-28 03:12:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153438448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:12:35,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:35,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069160560] [2022-04-28 03:12:35,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069160560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:35,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:12:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046899490] [2022-04-28 03:12:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2022-04-28 03:12:35,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:35,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 03:12:35,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:35,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:12:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:12:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:12:35,969 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 03:12:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:36,158 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:12:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:12:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2022-04-28 03:12:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 03:12:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:12:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 03:12:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:12:36,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 03:12:36,184 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 03:12:36,185 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:12:36,185 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:12:36,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:12:36,186 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:36,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:12:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:12:36,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:36,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 03:12:36,196 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 03:12:36,197 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 03:12:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:36,197 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:12:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:12:36,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:36,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:36,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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) Second operand 20 states. [2022-04-28 03:12:36,198 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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) Second operand 20 states. [2022-04-28 03:12:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:36,199 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:12:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:12:36,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:36,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:36,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:36,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 03:12:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 03:12:36,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-04-28 03:12:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:36,201 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 03:12:36,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 03:12:36,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 03:12:36,219 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 03:12:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:12:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:12:36,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:36,220 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:36,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:12:36,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash 976674245, now seen corresponding path program 2 times [2022-04-28 03:12:36,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:36,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [739550071] [2022-04-28 03:12:40,369 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:40,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:40,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:40,778 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1831905421, now seen corresponding path program 1 times [2022-04-28 03:12:40,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:40,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120769735] [2022-04-28 03:12:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-28 03:12:40,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-28 03:12:40,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-28 03:12:40,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:40,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {585#true} is VALID [2022-04-28 03:12:40,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-28 03:12:40,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-28 03:12:40,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-28 03:12:40,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {590#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:40,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {590#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {591#(= main_~y~0 0)} is VALID [2022-04-28 03:12:40,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(= main_~y~0 0)} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#(= main_~y~0 0)} is VALID [2022-04-28 03:12:40,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= main_~y~0 0)} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {592#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:40,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 0 main_~y~0)} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:40,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 0 main_~y~0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {593#(<= 1 main_~y~0)} is VALID [2022-04-28 03:12:40,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-28 03:12:40,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-28 03:12:40,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-28 03:12:40,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-28 03:12:40,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-28 03:12:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120769735] [2022-04-28 03:12:40,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120769735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302008419] [2022-04-28 03:12:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:40,844 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 03:12:40,847 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 03:12:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:12:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:41,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-28 03:12:41,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#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(9, 2); {585#true} is VALID [2022-04-28 03:12:41,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-28 03:12:41,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-28 03:12:41,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-28 03:12:41,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:41,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:41,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:41,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {592#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:41,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 0 main_~y~0)} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:41,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 0 main_~y~0)} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {593#(<= 1 main_~y~0)} is VALID [2022-04-28 03:12:41,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-28 03:12:41,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-28 03:12:41,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-28 03:12:41,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-28 03:12:41,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-28 03:12:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:41,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:41,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-28 03:12:41,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-28 03:12:41,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-28 03:12:41,386 INFO L272 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {586#false} is VALID [2022-04-28 03:12:41,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= 0 main_~y~0)} assume ~y~0 < 0; {586#false} is VALID [2022-04-28 03:12:41,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {659#(<= 0 (+ main_~y~0 1))} assume ~x~0 < 50;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {592#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:41,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [66] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-28 03:12:41,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [69] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_9| |v_main_#t~post1_8|)) (.cse0 (<= 0 (+ v_main_~y~0_20 1))) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (< v_main_~x~0_20 v_main_~x~0_19) .cse0 (= (+ v_main_~x~0_20 v_main_~y~0_19) (+ v_main_~x~0_19 v_main_~y~0_20)) (< v_main_~x~0_19 51)) (and .cse1 (= v_main_~y~0_20 v_main_~y~0_19) (= |v_main_#t~post3_13| |v_main_#t~post3_9|) .cse2) (and (= |v_main_#t~post3_9| |v_main_#t~post3_13|) .cse1 (or (not .cse0) (not (< v_main_~x~0_20 50))) (= v_main_~y~0_19 v_main_~y~0_20) .cse2))) InVars {main_~y~0=v_main_~y~0_20, main_#t~post3=|v_main_#t~post3_13|, main_~x~0=v_main_~x~0_20, main_#t~post1=|v_main_#t~post1_9|} OutVars{main_~y~0=v_main_~y~0_19, main_#t~post3=|v_main_#t~post3_9|, main_~x~0=v_main_~x~0_19, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-28 03:12:41,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [68] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-28 03:12:41,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#(<= 0 (+ main_~y~0 1))} [67] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_18)) (.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= v_main_~y~0_18 v_main_~y~0_17)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_18)) (not .cse3)) (= |v_main_#t~post3_8| |v_main_#t~post3_10|)) (let ((.cse4 (+ v_main_~x~0_18 v_main_~y~0_18))) (and (<= v_main_~x~0_17 .cse4) (= .cse4 (+ v_main_~x~0_17 v_main_~y~0_17)) (< v_main_~x~0_18 v_main_~x~0_17) .cse3)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_10| |v_main_#t~post3_8|)))) InVars {main_~y~0=v_main_~y~0_18, main_#t~post2=|v_main_#t~post2_4|, main_#t~post3=|v_main_#t~post3_10|, main_~x~0=v_main_~x~0_18} OutVars{main_~y~0=v_main_~y~0_17, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_8|, main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-28 03:12:41,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {659#(<= 0 (+ main_~y~0 1))} is VALID [2022-04-28 03:12:41,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret4 := main(); {585#true} is VALID [2022-04-28 03:12:41,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-28 03:12:41,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-28 03:12:41,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#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(9, 2); {585#true} is VALID [2022-04-28 03:12:41,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-28 03:12:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:12:41,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302008419] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:41,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:12:41,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 9 [2022-04-28 03:12:41,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [739550071] [2022-04-28 03:12:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [739550071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:41,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:41,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:12:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361847375] [2022-04-28 03:12:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 19 [2022-04-28 03:12:41,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:41,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 03:12:41,597 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 03:12:41,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:12:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:12:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:12:41,598 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 03:12:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:41,695 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 03:12:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:12:41,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 19 [2022-04-28 03:12:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 03:12:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 03:12:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 03:12:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 03:12:41,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-28 03:12:41,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:41,724 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:12:41,724 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:12:41,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:12:41,724 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:41,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:12:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 03:12:41,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:41,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 03:12:41,751 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 03:12:41,751 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 03:12:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:41,753 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:12:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 03:12:41,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:41,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:41,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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) Second operand 27 states. [2022-04-28 03:12:41,754 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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) Second operand 27 states. [2022-04-28 03:12:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:41,754 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:12:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 03:12:41,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:41,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:41,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:41,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 03:12:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 03:12:41,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-04-28 03:12:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 03:12:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 03:12:41,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 03:12:41,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 03:12:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:12:41,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:41,784 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:41,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:12:42,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:42,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1033932547, now seen corresponding path program 3 times [2022-04-28 03:12:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:42,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854980601] [2022-04-28 03:12:42,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:42,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:42,518 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 99580619, now seen corresponding path program 1 times [2022-04-28 03:12:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:42,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478380972] [2022-04-28 03:12:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-28 03:12:42,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-28 03:12:42,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-28 03:12:42,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:42,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {872#true} is VALID [2022-04-28 03:12:42,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-28 03:12:42,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-28 03:12:42,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-28 03:12:42,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:42,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:42,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:42,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:42,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:42,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {879#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:42,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= 0 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-28 03:12:42,583 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-28 03:12:42,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-28 03:12:42,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-28 03:12:42,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-28 03:12:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478380972] [2022-04-28 03:12:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478380972] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442676882] [2022-04-28 03:12:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:42,585 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 03:12:42,586 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 03:12:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:12:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:42,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-28 03:12:42,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#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(9, 2); {872#true} is VALID [2022-04-28 03:12:42,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-28 03:12:42,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-28 03:12:42,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-28 03:12:42,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {899#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:42,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#(<= main_~x~0 0)} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {899#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:42,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(<= main_~x~0 0)} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {899#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:42,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#(<= main_~x~0 0)} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:42,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:42,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {916#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:42,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {916#(<= 48 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-28 03:12:42,841 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-28 03:12:42,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-28 03:12:42,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-28 03:12:42,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-28 03:12:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:42,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:43,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-28 03:12:43,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-28 03:12:43,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-28 03:12:43,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {873#false} is VALID [2022-04-28 03:12:43,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= 0 main_~y~0)} assume ~y~0 < 0; {873#false} is VALID [2022-04-28 03:12:43,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {879#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:43,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} [70] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:43,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [73] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_17| |v_main_#t~post1_16|)) (.cse3 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (= |v_main_#t~post3_27| |v_main_#t~post3_23|)) (.cse0 (<= 0 (+ v_main_~y~0_41 1))) (.cse5 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse1 (+ v_main_~x~0_39 v_main_~y~0_40))) (and .cse0 (= (+ v_main_~x~0_38 v_main_~y~0_41) .cse1) (< .cse1 (+ v_main_~y~0_41 51)) (< v_main_~y~0_41 v_main_~y~0_40))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_39 50))) .cse5))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post3=|v_main_#t~post3_27|, main_~x~0=v_main_~x~0_39, main_#t~post1=|v_main_#t~post1_17|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post3=|v_main_#t~post3_23|, main_~x~0=v_main_~x~0_38, main_#t~post1=|v_main_#t~post1_16|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {947#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:43,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [72] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:43,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {961#(<= main_~x~0 48)} [71] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post3_24| |v_main_#t~post3_22|)) (.cse2 (= v_main_~y~0_39 v_main_~y~0_38)) (.cse3 (= |v_main_#t~post2_11| |v_main_#t~post2_10|)) (.cse4 (<= 50 v_main_~x~0_37))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_39))) .cse3) (and (<= 0 v_main_~y~0_38) (= (+ v_main_~x~0_36 v_main_~y~0_38) (+ v_main_~x~0_37 v_main_~y~0_39)) .cse4 (< v_main_~y~0_38 v_main_~y~0_39)))) InVars {main_~y~0=v_main_~y~0_39, main_#t~post2=|v_main_#t~post2_11|, main_#t~post3=|v_main_#t~post3_24|, main_~x~0=v_main_~x~0_37} OutVars{main_~y~0=v_main_~y~0_38, main_#t~post2=|v_main_#t~post2_10|, main_#t~post3=|v_main_#t~post3_22|, main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {954#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:43,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {961#(<= main_~x~0 48)} is VALID [2022-04-28 03:12:43,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret4 := main(); {872#true} is VALID [2022-04-28 03:12:43,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #61#return; {872#true} is VALID [2022-04-28 03:12:43,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-28 03:12:43,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#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(9, 2); {872#true} is VALID [2022-04-28 03:12:43,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-28 03:12:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:43,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442676882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:43,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:12:43,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:43,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854980601] [2022-04-28 03:12:43,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854980601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:43,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:43,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:12:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791329303] [2022-04-28 03:12:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-28 03:12:43,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:43,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 03:12:43,369 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 03:12:43,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:12:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:12:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:12:43,370 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 03:12:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:43,528 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 03:12:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:12:43,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-28 03:12:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 03:12:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:12:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 03:12:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:12:43,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 03:12:43,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:43,552 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:12:43,552 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:12:43,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:12:43,553 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:43,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:12:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:12:43,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:43,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 03:12:43,583 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 03:12:43,583 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 03:12:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:43,584 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:12:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:12:43,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:43,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:43,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) Second operand 29 states. [2022-04-28 03:12:43,585 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) Second operand 29 states. [2022-04-28 03:12:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:43,586 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:12:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:12:43,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:43,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:43,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:43,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 03:12:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 03:12:43,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2022-04-28 03:12:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:43,587 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 03:12:43,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 03:12:43,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 03:12:43,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:12:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:12:43,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:43,616 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:43,631 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 03:12:43,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 03:12:43,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash 965362855, now seen corresponding path program 4 times [2022-04-28 03:12:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:43,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103666972] [2022-04-28 03:12:47,952 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:48,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:51,141 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:12:51,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:51,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1690002485, now seen corresponding path program 1 times [2022-04-28 03:12:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919518936] [2022-04-28 03:12:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:51,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-28 03:12:51,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-28 03:12:51,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-28 03:12:51,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:51,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1198#true} is VALID [2022-04-28 03:12:51,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-28 03:12:51,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-28 03:12:51,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-28 03:12:51,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1203#(= main_~x~0 0)} is VALID [2022-04-28 03:12:51,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#(= main_~x~0 0)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1203#(= main_~x~0 0)} is VALID [2022-04-28 03:12:51,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(= main_~x~0 0)} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1203#(= main_~x~0 0)} is VALID [2022-04-28 03:12:51,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(= main_~x~0 0)} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:51,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:51,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {1204#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1205#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:51,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {1205#(<= 48 main_~y~0)} assume ~y~0 < 0; {1199#false} is VALID [2022-04-28 03:12:51,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-28 03:12:51,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-28 03:12:51,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-28 03:12:51,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-28 03:12:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919518936] [2022-04-28 03:12:51,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919518936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812243080] [2022-04-28 03:12:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:51,313 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 03:12:51,314 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 03:12:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:51,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:12:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:51,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:51,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2022-04-28 03:12:51,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#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(9, 2); {1198#true} is VALID [2022-04-28 03:12:51,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-28 03:12:51,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-28 03:12:51,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-28 03:12:51,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1225#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:51,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {1225#(<= main_~x~0 0)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1225#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:51,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {1225#(<= main_~x~0 0)} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:51,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {1225#(<= main_~x~0 0)} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:51,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:51,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {1235#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1205#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:51,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1205#(<= 48 main_~y~0)} assume ~y~0 < 0; {1199#false} is VALID [2022-04-28 03:12:51,549 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-28 03:12:51,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-28 03:12:51,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-28 03:12:51,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-28 03:12:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:51,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:51,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2022-04-28 03:12:51,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {1199#false} assume 0 == ~cond; {1199#false} is VALID [2022-04-28 03:12:51,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2022-04-28 03:12:51,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {1199#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1199#false} is VALID [2022-04-28 03:12:51,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(not (< main_~y~0 0))} assume ~y~0 < 0; {1199#false} is VALID [2022-04-28 03:12:51,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1269#(not (< main_~y~0 0))} is VALID [2022-04-28 03:12:51,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} [74] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:51,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [77] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse2 (= |v_main_#t~post1_24| |v_main_#t~post1_23|)) (.cse3 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse0 (<= 0 (+ v_main_~y~0_62 1)))) (or (and (= (+ v_main_~x~0_57 v_main_~y~0_61) (+ v_main_~x~0_56 v_main_~y~0_62)) (< v_main_~x~0_56 51) .cse0 (< v_main_~x~0_57 v_main_~x~0_56)) (and .cse1 (= |v_main_#t~post3_41| |v_main_#t~post3_37|) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_37| |v_main_#t~post3_41|) (or (not .cse0) (not (< v_main_~x~0_57 50)))))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post3=|v_main_#t~post3_41|, main_~x~0=v_main_~x~0_57, main_#t~post1=|v_main_#t~post1_24|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post3=|v_main_#t~post3_37|, main_~x~0=v_main_~x~0_56, main_#t~post1=|v_main_#t~post1_23|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1273#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:51,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [76] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:51,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#(<= main_~x~0 48)} [75] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_19| |v_main_#t~post2_18|)) (.cse1 (= v_main_~x~0_55 v_main_~x~0_54)) (.cse2 (<= 50 v_main_~x~0_55))) (or (and (= |v_main_#t~post3_38| |v_main_#t~post3_36|) (= v_main_~y~0_60 v_main_~y~0_59) .cse0 .cse1) (and (= v_main_~y~0_59 v_main_~y~0_60) (or (not .cse2) (not (<= 1 v_main_~y~0_60))) .cse0 .cse1 (= |v_main_#t~post3_36| |v_main_#t~post3_38|)) (let ((.cse3 (+ v_main_~x~0_55 v_main_~y~0_60))) (and (= (+ v_main_~x~0_54 v_main_~y~0_59) .cse3) .cse2 (<= v_main_~x~0_54 .cse3) (< v_main_~x~0_55 v_main_~x~0_54))))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post2=|v_main_#t~post2_19|, main_#t~post3=|v_main_#t~post3_38|, main_~x~0=v_main_~x~0_55} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post2=|v_main_#t~post2_18|, main_#t~post3=|v_main_#t~post3_36|, main_~x~0=v_main_~x~0_54} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1280#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:51,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1287#(<= main_~x~0 48)} is VALID [2022-04-28 03:12:51,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret4 := main(); {1198#true} is VALID [2022-04-28 03:12:51,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #61#return; {1198#true} is VALID [2022-04-28 03:12:51,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2022-04-28 03:12:51,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#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(9, 2); {1198#true} is VALID [2022-04-28 03:12:51,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2022-04-28 03:12:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:51,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812243080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:51,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:51,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:12:52,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103666972] [2022-04-28 03:12:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103666972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:52,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:52,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:12:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91428908] [2022-04-28 03:12:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:52,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 03:12:52,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:52,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 03:12:52,046 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 03:12:52,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:12:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:52,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:12:52,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:12:52,046 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 03:12:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:52,236 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 03:12:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:12:52,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 03:12:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 03:12:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 03:12:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 03:12:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 03:12:52,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 03:12:52,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:52,261 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:12:52,261 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:12:52,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:12:52,261 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:52,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:12:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 03:12:52,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:52,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 03:12:52,299 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 03:12:52,299 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 03:12:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:52,300 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 03:12:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 03:12:52,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:52,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:52,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) Second operand 33 states. [2022-04-28 03:12:52,301 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) Second operand 33 states. [2022-04-28 03:12:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:52,302 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 03:12:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 03:12:52,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:52,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:52,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:52,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 03:12:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 03:12:52,303 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2022-04-28 03:12:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:52,303 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 03:12:52,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 03:12:52,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 03:12:52,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 03:12:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:12:52,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:52,333 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:52,363 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 03:12:52,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:52,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1684865917, now seen corresponding path program 5 times [2022-04-28 03:12:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:52,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386844090] [2022-04-28 03:12:52,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:52,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:52,965 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 815381707, now seen corresponding path program 1 times [2022-04-28 03:12:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:52,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022533115] [2022-04-28 03:12:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:53,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-28 03:12:53,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-28 03:12:53,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-28 03:12:53,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:53,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1545#true} is VALID [2022-04-28 03:12:53,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-28 03:12:53,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-28 03:12:53,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-28 03:12:53,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1550#(= main_~x~0 0)} is VALID [2022-04-28 03:12:53,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#(= main_~x~0 0)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1551#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:53,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(<= main_~x~0 0)} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:53,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {1551#(<= main_~x~0 0)} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:53,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:12:53,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1552#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1553#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:53,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {1553#(<= 48 main_~y~0)} assume ~y~0 < 0; {1546#false} is VALID [2022-04-28 03:12:53,028 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-28 03:12:53,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-28 03:12:53,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-28 03:12:53,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-28 03:12:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:53,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022533115] [2022-04-28 03:12:53,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022533115] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:53,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825504284] [2022-04-28 03:12:53,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:53,029 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 03:12:53,030 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 03:12:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:53,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:12:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:53,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:53,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2022-04-28 03:12:53,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#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(9, 2); {1545#true} is VALID [2022-04-28 03:12:53,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-28 03:12:53,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-28 03:12:53,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-28 03:12:53,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1551#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:53,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {1551#(<= main_~x~0 0)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1551#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:53,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(<= main_~x~0 0)} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:53,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1551#(<= main_~x~0 0)} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:53,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:53,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1582#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1553#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:53,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1553#(<= 48 main_~y~0)} assume ~y~0 < 0; {1546#false} is VALID [2022-04-28 03:12:53,241 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-28 03:12:53,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-28 03:12:53,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-28 03:12:53,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-28 03:12:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:53,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:53,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-04-28 03:12:53,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#false} assume 0 == ~cond; {1546#false} is VALID [2022-04-28 03:12:53,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#false} ~cond := #in~cond; {1546#false} is VALID [2022-04-28 03:12:53,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {1546#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1546#false} is VALID [2022-04-28 03:12:53,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {1616#(not (< main_~y~0 0))} assume ~y~0 < 0; {1546#false} is VALID [2022-04-28 03:12:53,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1616#(not (< main_~y~0 0))} is VALID [2022-04-28 03:12:53,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} [78] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:53,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [81] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_84 1))) (.cse0 (= |v_main_#t~post1_31| |v_main_#t~post1_30|)) (.cse1 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse2 (= v_main_~y~0_84 v_main_~y~0_83)) (.cse3 (= |v_main_#t~post3_55| |v_main_#t~post3_51|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_76 50)))) (and (< v_main_~x~0_76 v_main_~x~0_75) (= (+ v_main_~x~0_75 v_main_~y~0_84) (+ v_main_~x~0_76 v_main_~y~0_83)) .cse4 (< v_main_~x~0_75 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_84, main_#t~post3=|v_main_#t~post3_55|, main_~x~0=v_main_~x~0_76, main_#t~post1=|v_main_#t~post1_31|} OutVars{main_~y~0=v_main_~y~0_83, main_#t~post3=|v_main_#t~post3_51|, main_~x~0=v_main_~x~0_75, main_#t~post1=|v_main_#t~post1_30|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1620#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:53,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [80] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:53,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {1634#(<= main_~x~0 48)} [79] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse3 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse4 (= |v_main_#t~post3_52| |v_main_#t~post3_50|)) (.cse1 (<= 50 v_main_~x~0_74)) (.cse5 (= |v_main_#t~post2_27| |v_main_#t~post2_26|))) (or (let ((.cse0 (+ v_main_~x~0_74 v_main_~y~0_82))) (and (= (+ v_main_~x~0_73 v_main_~y~0_81) .cse0) (< v_main_~x~0_74 v_main_~x~0_73) .cse1 (<= v_main_~x~0_73 .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (<= 1 v_main_~y~0_82))) .cse5))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post2=|v_main_#t~post2_27|, main_#t~post3=|v_main_#t~post3_52|, main_~x~0=v_main_~x~0_74} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post2=|v_main_#t~post2_26|, main_#t~post3=|v_main_#t~post3_50|, main_~x~0=v_main_~x~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1627#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:53,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1634#(<= main_~x~0 48)} is VALID [2022-04-28 03:12:53,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret4 := main(); {1545#true} is VALID [2022-04-28 03:12:53,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #61#return; {1545#true} is VALID [2022-04-28 03:12:53,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2022-04-28 03:12:53,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#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(9, 2); {1545#true} is VALID [2022-04-28 03:12:53,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2022-04-28 03:12:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:53,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825504284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:53,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:53,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-28 03:12:53,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:53,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386844090] [2022-04-28 03:12:53,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386844090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:53,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:53,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:12:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526536071] [2022-04-28 03:12:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-28 03:12:53,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:53,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 03:12:53,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:53,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:12:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:12:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:12:53,821 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 03:12:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,119 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 03:12:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:12:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-28 03:12:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 03:12:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:12:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 03:12:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:12:54,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 03:12:54,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:54,168 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:12:54,168 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:12:54,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:12:54,169 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:54,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:12:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 03:12:54,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:54,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 03:12:54,204 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 03:12:54,204 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 03:12:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,204 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 03:12:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:12:54,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:54,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:54,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) Second operand 36 states. [2022-04-28 03:12:54,205 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) Second operand 36 states. [2022-04-28 03:12:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:54,206 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 03:12:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:12:54,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:54,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:54,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:54,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 03:12:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-28 03:12:54,207 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2022-04-28 03:12:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:54,207 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-28 03:12:54,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 03:12:54,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-28 03:12:54,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 03:12:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:12:54,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:54,248 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:54,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:12:54,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:54,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -266410201, now seen corresponding path program 6 times [2022-04-28 03:12:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110286501] [2022-04-28 03:12:54,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:54,907 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:54,908 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -974201397, now seen corresponding path program 1 times [2022-04-28 03:12:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:54,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887498174] [2022-04-28 03:12:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:54,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-28 03:12:54,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-28 03:12:54,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-28 03:12:54,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:54,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1916#true} is VALID [2022-04-28 03:12:54,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-28 03:12:54,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-28 03:12:54,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-28 03:12:54,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:54,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:54,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1921#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:12:54,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {1921#(and (= main_~x~0 0) (= main_~y~0 0))} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:54,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:54,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1923#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:54,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {1923#(<= 0 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-28 03:12:54,965 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-28 03:12:54,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-28 03:12:54,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-28 03:12:54,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-28 03:12:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:54,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887498174] [2022-04-28 03:12:54,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887498174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:54,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694907877] [2022-04-28 03:12:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:54,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:54,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:54,967 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 03:12:54,968 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 03:12:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:54,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:12:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:54,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:55,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1916#true} is VALID [2022-04-28 03:12:55,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#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(9, 2); {1916#true} is VALID [2022-04-28 03:12:55,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-28 03:12:55,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-28 03:12:55,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-28 03:12:55,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {1943#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:55,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {1943#(<= main_~x~0 0)} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1943#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:55,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#(<= main_~x~0 0)} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1943#(<= main_~x~0 0)} is VALID [2022-04-28 03:12:55,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#(<= main_~x~0 0)} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:55,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:12:55,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1953#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1960#(<= 48 main_~y~0)} is VALID [2022-04-28 03:12:55,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1960#(<= 48 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-28 03:12:55,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-28 03:12:55,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-28 03:12:55,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-28 03:12:55,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-28 03:12:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:12:55,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:55,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#false} assume !false; {1917#false} is VALID [2022-04-28 03:12:55,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#false} assume 0 == ~cond; {1917#false} is VALID [2022-04-28 03:12:55,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#false} ~cond := #in~cond; {1917#false} is VALID [2022-04-28 03:12:55,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {1917#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {1917#false} is VALID [2022-04-28 03:12:55,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1923#(<= 0 main_~y~0)} assume ~y~0 < 0; {1917#false} is VALID [2022-04-28 03:12:55,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {1923#(<= 0 main_~y~0)} is VALID [2022-04-28 03:12:55,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} [82] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:55,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [85] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_107 1))) (.cse2 (= v_main_~x~0_96 v_main_~x~0_95)) (.cse3 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse4 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse5 (= |v_main_#t~post1_38| |v_main_#t~post1_37|))) (or (let ((.cse0 (+ v_main_~x~0_96 v_main_~y~0_106))) (and (= (+ v_main_~x~0_95 v_main_~y~0_107) .cse0) (< .cse0 (+ 51 v_main_~y~0_107)) .cse1 (< v_main_~y~0_107 v_main_~y~0_106))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_96 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post3=|v_main_#t~post3_69|, main_~x~0=v_main_~x~0_96, main_#t~post1=|v_main_#t~post1_38|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post3=|v_main_#t~post3_65|, main_~x~0=v_main_~x~0_95, main_#t~post1=|v_main_#t~post1_37|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {1991#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:12:55,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [84] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:55,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {2005#(<= main_~x~0 48)} [83] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_35| |v_main_#t~post2_34|)) (.cse1 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse5 (<= 50 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_105 v_main_~y~0_104)) (.cse3 (= |v_main_#t~post3_66| |v_main_#t~post3_64|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_94 v_main_~y~0_105))) (and (< v_main_~x~0_94 v_main_~x~0_93) (<= v_main_~x~0_93 .cse4) (= .cse4 (+ v_main_~x~0_93 v_main_~y~0_104)) .cse5)) (and .cse0 .cse1 (or (not .cse5) (not (<= 1 v_main_~y~0_105))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_105, main_#t~post2=|v_main_#t~post2_35|, main_#t~post3=|v_main_#t~post3_66|, main_~x~0=v_main_~x~0_94} OutVars{main_~y~0=v_main_~y~0_104, main_#t~post2=|v_main_#t~post2_34|, main_#t~post3=|v_main_#t~post3_64|, main_~x~0=v_main_~x~0_93} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {1998#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:12:55,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {1916#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2005#(<= main_~x~0 48)} is VALID [2022-04-28 03:12:55,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {1916#true} call #t~ret4 := main(); {1916#true} is VALID [2022-04-28 03:12:55,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1916#true} {1916#true} #61#return; {1916#true} is VALID [2022-04-28 03:12:55,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#true} assume true; {1916#true} is VALID [2022-04-28 03:12:55,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#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(9, 2); {1916#true} is VALID [2022-04-28 03:12:55,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {1916#true} call ULTIMATE.init(); {1916#true} is VALID [2022-04-28 03:12:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:55,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694907877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:55,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:55,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:12:55,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:55,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110286501] [2022-04-28 03:12:55,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110286501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:55,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:55,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:12:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695665428] [2022-04-28 03:12:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 28 [2022-04-28 03:12:55,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:55,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 03:12:55,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:55,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:12:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:12:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:12:55,747 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 03:12:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:56,053 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 03:12:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:12:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 28 [2022-04-28 03:12:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 03:12:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 03:12:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 03:12:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 03:12:56,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-28 03:12:56,077 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 03:12:56,078 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:12:56,078 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:12:56,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:12:56,080 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:56,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:12:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:12:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:12:56,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:56,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 03:12:56,126 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 03:12:56,126 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 03:12:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:56,132 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 03:12:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 03:12:56,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:56,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:56,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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) Second operand 38 states. [2022-04-28 03:12:56,133 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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) Second operand 38 states. [2022-04-28 03:12:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:56,133 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 03:12:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 03:12:56,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:56,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:56,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:56,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 03:12:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 03:12:56,136 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2022-04-28 03:12:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:56,137 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 03:12:56,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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 03:12:56,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 03:12:56,180 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 03:12:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 03:12:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:12:56,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:56,181 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:56,199 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 03:12:56,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:56,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1235400189, now seen corresponding path program 7 times [2022-04-28 03:12:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:56,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289416292] [2022-04-28 03:13:00,497 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:00,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:04,264 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:04,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:04,401 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1531182795, now seen corresponding path program 1 times [2022-04-28 03:13:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:04,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52541346] [2022-04-28 03:13:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:04,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-28 03:13:04,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-28 03:13:04,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-28 03:13:04,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:04,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2314#true} is VALID [2022-04-28 03:13:04,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-28 03:13:04,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-28 03:13:04,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-28 03:13:04,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2319#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:04,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:04,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:04,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {2320#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:04,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:04,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {2321#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2322#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:04,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {2322#(<= 49 main_~y~0)} assume ~y~0 < 0; {2315#false} is VALID [2022-04-28 03:13:04,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-28 03:13:04,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-28 03:13:04,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-28 03:13:04,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-28 03:13:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:04,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52541346] [2022-04-28 03:13:04,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52541346] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:04,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990267638] [2022-04-28 03:13:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:04,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:04,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:04,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:13:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:04,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:13:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:04,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2022-04-28 03:13:04,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#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(9, 2); {2314#true} is VALID [2022-04-28 03:13:04,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-28 03:13:04,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-28 03:13:04,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-28 03:13:04,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2342#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:04,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2342#(<= main_~x~0 0)} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2342#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:04,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(<= main_~x~0 0)} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2342#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:04,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(<= main_~x~0 0)} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:04,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:04,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {2352#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2359#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:04,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= 48 main_~y~0)} assume ~y~0 < 0; {2315#false} is VALID [2022-04-28 03:13:04,714 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-28 03:13:04,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-28 03:13:04,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-28 03:13:04,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-28 03:13:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:04,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:04,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2022-04-28 03:13:04,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#false} assume 0 == ~cond; {2315#false} is VALID [2022-04-28 03:13:04,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#false} ~cond := #in~cond; {2315#false} is VALID [2022-04-28 03:13:04,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {2315#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2315#false} is VALID [2022-04-28 03:13:04,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {2387#(not (< main_~y~0 0))} assume ~y~0 < 0; {2315#false} is VALID [2022-04-28 03:13:04,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2387#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:04,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} [86] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:04,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [89] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_131 1))) (.cse1 (= |v_main_#t~post1_45| |v_main_#t~post1_44|)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_131 v_main_~y~0_130))) (or (and (< v_main_~x~0_116 51) (< v_main_~x~0_117 v_main_~x~0_116) (= (+ v_main_~x~0_117 v_main_~y~0_130) (+ v_main_~x~0_116 v_main_~y~0_131)) .cse0) (and .cse1 (= |v_main_#t~post3_83| |v_main_#t~post3_79|) .cse2 .cse3) (and (or (not (< v_main_~x~0_117 50)) (not .cse0)) .cse1 .cse2 .cse3 (= |v_main_#t~post3_79| |v_main_#t~post3_83|)))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post3=|v_main_#t~post3_83|, main_~x~0=v_main_~x~0_117, main_#t~post1=|v_main_#t~post1_45|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post3=|v_main_#t~post3_79|, main_~x~0=v_main_~x~0_116, main_#t~post1=|v_main_#t~post1_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2391#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:04,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [88] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:04,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {2405#(<= main_~x~0 48)} [87] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_115)) (.cse1 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse2 (= v_main_~y~0_129 v_main_~y~0_128)) (.cse3 (= |v_main_#t~post2_43| |v_main_#t~post2_42|))) (or (and (<= 0 v_main_~y~0_128) (= (+ v_main_~x~0_115 v_main_~y~0_129) (+ v_main_~x~0_114 v_main_~y~0_128)) .cse0 (< v_main_~y~0_128 v_main_~y~0_129)) (and (or (not (<= 1 v_main_~y~0_129)) (not .cse0)) .cse1 (= |v_main_#t~post3_78| |v_main_#t~post3_80|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post3_80| |v_main_#t~post3_78|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_129, main_#t~post2=|v_main_#t~post2_43|, main_#t~post3=|v_main_#t~post3_80|, main_~x~0=v_main_~x~0_115} OutVars{main_~y~0=v_main_~y~0_128, main_#t~post2=|v_main_#t~post2_42|, main_#t~post3=|v_main_#t~post3_78|, main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2398#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:04,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2405#(<= main_~x~0 48)} is VALID [2022-04-28 03:13:04,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret4 := main(); {2314#true} is VALID [2022-04-28 03:13:04,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #61#return; {2314#true} is VALID [2022-04-28 03:13:04,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2022-04-28 03:13:04,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#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(9, 2); {2314#true} is VALID [2022-04-28 03:13:04,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2022-04-28 03:13:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:04,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990267638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:04,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:04,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:13:05,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289416292] [2022-04-28 03:13:05,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289416292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:05,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:05,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:13:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333688414] [2022-04-28 03:13:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 31 [2022-04-28 03:13:05,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:05,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 03:13:05,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:13:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:05,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:13:05,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:13:05,126 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 03:13:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:05,491 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-28 03:13:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:13:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 31 [2022-04-28 03:13:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 03:13:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-28 03:13:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 03:13:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-28 03:13:05,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 43 transitions. [2022-04-28 03:13:05,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:05,528 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:13:05,528 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:13:05,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:13:05,529 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:05,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 35 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:13:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:13:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 03:13:05,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:05,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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 03:13:05,586 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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 03:13:05,592 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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 03:13:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:05,593 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:13:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:13:05,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:05,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:05,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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) Second operand 42 states. [2022-04-28 03:13:05,595 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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) Second operand 42 states. [2022-04-28 03:13:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:05,600 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:13:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:13:05,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:05,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:05,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:05,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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 03:13:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-28 03:13:05,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2022-04-28 03:13:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:05,601 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-28 03:13:05,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 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 03:13:05,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-28 03:13:05,636 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 03:13:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 03:13:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:13:05,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:05,637 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 03:13:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:05,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1940936281, now seen corresponding path program 8 times [2022-04-28 03:13:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576216459] [2022-04-28 03:13:06,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:09,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:09,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -258400309, now seen corresponding path program 1 times [2022-04-28 03:13:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:09,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880062456] [2022-04-28 03:13:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-28 03:13:09,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-28 03:13:09,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-28 03:13:09,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:09,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2740#true} is VALID [2022-04-28 03:13:09,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-28 03:13:09,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-28 03:13:09,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-28 03:13:09,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2745#(= main_~x~0 0)} is VALID [2022-04-28 03:13:09,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#(= main_~x~0 0)} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2745#(= main_~x~0 0)} is VALID [2022-04-28 03:13:09,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#(= main_~x~0 0)} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2745#(= main_~x~0 0)} is VALID [2022-04-28 03:13:09,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(= main_~x~0 0)} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:09,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:09,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {2746#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2747#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:09,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(<= 48 main_~y~0)} assume ~y~0 < 0; {2741#false} is VALID [2022-04-28 03:13:09,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-28 03:13:09,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-28 03:13:09,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-28 03:13:09,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-28 03:13:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:09,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880062456] [2022-04-28 03:13:09,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880062456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782530990] [2022-04-28 03:13:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:09,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:09,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:09,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:09,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:13:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:09,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:09,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-28 03:13:09,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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(9, 2); {2740#true} is VALID [2022-04-28 03:13:09,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-28 03:13:09,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-28 03:13:09,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-28 03:13:09,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:09,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:09,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:09,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:09,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:09,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2784#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:09,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {2784#(<= 49 main_~y~0)} assume ~y~0 < 0; {2741#false} is VALID [2022-04-28 03:13:09,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-28 03:13:09,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-28 03:13:09,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-28 03:13:09,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-28 03:13:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:09,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:10,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-28 03:13:10,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-28 03:13:10,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-28 03:13:10,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {2741#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {2741#false} is VALID [2022-04-28 03:13:10,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {2812#(not (< main_~y~0 0))} assume ~y~0 < 0; {2741#false} is VALID [2022-04-28 03:13:10,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {2812#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:10,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} [90] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:10,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [93] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_97| |v_main_#t~post3_93|)) (.cse1 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse2 (= |v_main_#t~post1_52| |v_main_#t~post1_51|)) (.cse3 (= v_main_~y~0_156 v_main_~y~0_155)) (.cse4 (<= 0 (+ v_main_~y~0_156 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_139 50))) .cse2 .cse3) (and (= (+ v_main_~x~0_138 v_main_~y~0_156) (+ v_main_~x~0_139 v_main_~y~0_155)) (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 51) .cse4))) InVars {main_~y~0=v_main_~y~0_156, main_#t~post3=|v_main_#t~post3_97|, main_~x~0=v_main_~x~0_139, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~y~0=v_main_~y~0_155, main_#t~post3=|v_main_#t~post3_93|, main_~x~0=v_main_~x~0_138, main_#t~post1=|v_main_#t~post1_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {2816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:10,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [92] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:10,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2830#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [91] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_94| |v_main_#t~post3_92|)) (.cse2 (= v_main_~x~0_137 v_main_~x~0_136)) (.cse3 (= |v_main_#t~post2_51| |v_main_#t~post2_50|)) (.cse4 (= v_main_~y~0_154 v_main_~y~0_153)) (.cse0 (<= 50 v_main_~x~0_137))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_154))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_137 v_main_~y~0_154))) (and (< v_main_~x~0_137 v_main_~x~0_136) .cse0 (<= v_main_~x~0_136 .cse5) (= .cse5 (+ v_main_~x~0_136 v_main_~y~0_153)))))) InVars {main_~y~0=v_main_~y~0_154, main_#t~post2=|v_main_#t~post2_51|, main_#t~post3=|v_main_#t~post3_94|, main_~x~0=v_main_~x~0_137} OutVars{main_~y~0=v_main_~y~0_153, main_#t~post2=|v_main_#t~post2_50|, main_#t~post3=|v_main_#t~post3_92|, main_~x~0=v_main_~x~0_136} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {2823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:10,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {2830#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:10,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret4 := main(); {2740#true} is VALID [2022-04-28 03:13:10,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #61#return; {2740#true} is VALID [2022-04-28 03:13:10,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-28 03:13:10,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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(9, 2); {2740#true} is VALID [2022-04-28 03:13:10,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-28 03:13:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782530990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:10,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:10,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:10,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:10,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576216459] [2022-04-28 03:13:10,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576216459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:10,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:10,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:13:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696049834] [2022-04-28 03:13:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 34 [2022-04-28 03:13:10,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:10,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 03:13:10,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:10,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:13:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:13:10,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:13:10,288 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 03:13:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:10,867 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 03:13:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:13:10,867 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 34 [2022-04-28 03:13:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 03:13:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-04-28 03:13:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 03:13:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-04-28 03:13:10,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2022-04-28 03:13:10,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:10,914 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:13:10,914 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:13:10,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:13:10,915 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:10,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:13:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:13:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-28 03:13:10,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:10,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 03:13:10,992 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 03:13:10,993 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 03:13:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:10,993 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 03:13:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 03:13:10,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:10,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:10,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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) Second operand 45 states. [2022-04-28 03:13:10,994 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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) Second operand 45 states. [2022-04-28 03:13:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:10,994 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 03:13:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 03:13:10,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:10,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:10,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:10,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 03:13:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-28 03:13:10,995 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-04-28 03:13:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:10,995 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-28 03:13:10,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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 03:13:10,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-28 03:13:11,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 03:13:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:13:11,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:11,049 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:11,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:11,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:11,265 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -996706429, now seen corresponding path program 9 times [2022-04-28 03:13:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:11,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134890697] [2022-04-28 03:13:11,479 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:11,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:11,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2047983413, now seen corresponding path program 1 times [2022-04-28 03:13:11,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:11,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506890511] [2022-04-28 03:13:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:11,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-28 03:13:11,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 03:13:11,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-28 03:13:11,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:11,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3184#true} is VALID [2022-04-28 03:13:11,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 03:13:11,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-28 03:13:11,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-28 03:13:11,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:11,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:11,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3189#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:11,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {3189#(and (= main_~x~0 0) (= main_~y~0 0))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:11,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:11,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3191#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:11,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 49 main_~y~0)} assume ~y~0 < 0; {3185#false} is VALID [2022-04-28 03:13:11,767 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-28 03:13:11,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 03:13:11,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 03:13:11,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 03:13:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:11,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:11,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506890511] [2022-04-28 03:13:11,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506890511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:11,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955096307] [2022-04-28 03:13:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:11,768 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:11,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:13:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:11,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:11,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:12,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-28 03:13:12,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#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(9, 2); {3184#true} is VALID [2022-04-28 03:13:12,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 03:13:12,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-28 03:13:12,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-28 03:13:12,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:12,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:12,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:12,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {3211#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:12,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:12,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {3221#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3191#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:12,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 49 main_~y~0)} assume ~y~0 < 0; {3185#false} is VALID [2022-04-28 03:13:12,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-28 03:13:12,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 03:13:12,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 03:13:12,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 03:13:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:12,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:12,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 03:13:12,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 03:13:12,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 03:13:12,551 INFO L272 TraceCheckUtils]: 12: Hoare triple {3185#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3185#false} is VALID [2022-04-28 03:13:12,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(not (< main_~y~0 0))} assume ~y~0 < 0; {3185#false} is VALID [2022-04-28 03:13:12,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3255#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:12,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} [94] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:12,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [97] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_182 1))) (.cse1 (= |v_main_#t~post3_111| |v_main_#t~post3_107|)) (.cse2 (= v_main_~y~0_182 v_main_~y~0_181)) (.cse3 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse4 (= |v_main_#t~post1_59| |v_main_#t~post1_58|))) (or (and (= (+ v_main_~x~0_162 v_main_~y~0_181) (+ v_main_~x~0_161 v_main_~y~0_182)) (< v_main_~x~0_162 v_main_~x~0_161) (< v_main_~x~0_161 51) .cse0) (and .cse1 (or (not (< v_main_~x~0_162 50)) (not .cse0)) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_182, main_#t~post3=|v_main_#t~post3_111|, main_~x~0=v_main_~x~0_162, main_#t~post1=|v_main_#t~post1_59|} OutVars{main_~y~0=v_main_~y~0_181, main_#t~post3=|v_main_#t~post3_107|, main_~x~0=v_main_~x~0_161, main_#t~post1=|v_main_#t~post1_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3259#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:12,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [96] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:12,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {3273#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [95] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_59| |v_main_#t~post2_58|)) (.cse1 (= v_main_~x~0_160 v_main_~x~0_159)) (.cse2 (= v_main_~y~0_180 v_main_~y~0_179)) (.cse3 (= |v_main_#t~post3_108| |v_main_#t~post3_106|)) (.cse4 (<= 50 v_main_~x~0_160))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (<= 1 v_main_~y~0_180))) .cse3) (let ((.cse5 (+ v_main_~x~0_160 v_main_~y~0_180))) (and (<= v_main_~x~0_159 .cse5) .cse4 (< v_main_~x~0_160 v_main_~x~0_159) (= .cse5 (+ v_main_~x~0_159 v_main_~y~0_179)))))) InVars {main_~y~0=v_main_~y~0_180, main_#t~post2=|v_main_#t~post2_59|, main_#t~post3=|v_main_#t~post3_108|, main_~x~0=v_main_~x~0_160} OutVars{main_~y~0=v_main_~y~0_179, main_#t~post2=|v_main_#t~post2_58|, main_#t~post3=|v_main_#t~post3_106|, main_~x~0=v_main_~x~0_159} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3266#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:12,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3273#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:12,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret4 := main(); {3184#true} is VALID [2022-04-28 03:13:12,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #61#return; {3184#true} is VALID [2022-04-28 03:13:12,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 03:13:12,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#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(9, 2); {3184#true} is VALID [2022-04-28 03:13:12,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-28 03:13:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:12,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955096307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:12,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:12,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:13:12,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134890697] [2022-04-28 03:13:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134890697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:13:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153931379] [2022-04-28 03:13:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 37 [2022-04-28 03:13:12,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:12,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 03:13:12,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:13:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:13:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:13:12,845 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 03:13:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:13,644 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-28 03:13:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:13:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 37 [2022-04-28 03:13:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 03:13:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-28 03:13:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 03:13:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-28 03:13:13,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 49 transitions. [2022-04-28 03:13:13,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:13,681 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:13:13,681 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 03:13:13,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:13:13,682 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:13,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 03:13:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-28 03:13:13,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:13,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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 03:13:13,754 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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 03:13:13,754 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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 03:13:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:13,765 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 03:13:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-28 03:13:13,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:13,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:13,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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) Second operand 48 states. [2022-04-28 03:13:13,766 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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) Second operand 48 states. [2022-04-28 03:13:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:13,766 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 03:13:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-28 03:13:13,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:13,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:13,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:13,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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 03:13:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 03:13:13,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2022-04-28 03:13:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:13,771 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 03:13:13,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 03:13:13,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 03:13:13,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 03:13:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:13:13,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:13,819 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:13,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:14,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 03:13:14,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 813992999, now seen corresponding path program 10 times [2022-04-28 03:13:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:14,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704903976] [2022-04-28 03:13:14,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:18,019 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:18,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:18,113 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash 457400779, now seen corresponding path program 1 times [2022-04-28 03:13:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:18,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600156498] [2022-04-28 03:13:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:18,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:18,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-28 03:13:18,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-28 03:13:18,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-28 03:13:18,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:18,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {3664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3656#true} is VALID [2022-04-28 03:13:18,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-28 03:13:18,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-28 03:13:18,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-28 03:13:18,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3661#(= main_~x~0 0)} is VALID [2022-04-28 03:13:18,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(= main_~x~0 0)} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3661#(= main_~x~0 0)} is VALID [2022-04-28 03:13:18,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#(= main_~x~0 0)} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3661#(= main_~x~0 0)} is VALID [2022-04-28 03:13:18,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(= main_~x~0 0)} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:18,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:18,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {3662#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3663#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-28 03:13:18,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {3663#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {3657#false} is VALID [2022-04-28 03:13:18,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-28 03:13:18,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-28 03:13:18,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-28 03:13:18,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-28 03:13:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600156498] [2022-04-28 03:13:18,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600156498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048150916] [2022-04-28 03:13:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:18,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:18,174 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:18,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:13:18,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2022-04-28 03:13:18,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#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(9, 2); {3656#true} is VALID [2022-04-28 03:13:18,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-28 03:13:18,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-28 03:13:18,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-28 03:13:18,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:18,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:18,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:18,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {3683#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:18,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:18,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {3693#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3700#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:18,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {3700#(<= 49 main_~y~0)} assume ~y~0 < 0; {3657#false} is VALID [2022-04-28 03:13:18,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-28 03:13:18,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-28 03:13:18,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-28 03:13:18,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-28 03:13:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:18,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:18,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-04-28 03:13:18,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#false} assume 0 == ~cond; {3657#false} is VALID [2022-04-28 03:13:18,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#false} ~cond := #in~cond; {3657#false} is VALID [2022-04-28 03:13:18,900 INFO L272 TraceCheckUtils]: 12: Hoare triple {3657#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {3657#false} is VALID [2022-04-28 03:13:18,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {3728#(not (< main_~y~0 0))} assume ~y~0 < 0; {3657#false} is VALID [2022-04-28 03:13:18,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {3728#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:18,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} [98] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:18,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [101] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_209 1))) (.cse0 (= |v_main_#t~post1_66| |v_main_#t~post1_65|)) (.cse1 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse3 (= |v_main_#t~post3_125| |v_main_#t~post3_121|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_186 50)) (not .cse4))) (and (= (+ v_main_~x~0_186 v_main_~y~0_208) (+ v_main_~x~0_185 v_main_~y~0_209)) (< v_main_~x~0_186 v_main_~x~0_185) .cse4 (< v_main_~x~0_185 51)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post3=|v_main_#t~post3_125|, main_~x~0=v_main_~x~0_186, main_#t~post1=|v_main_#t~post1_66|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post3=|v_main_#t~post3_121|, main_~x~0=v_main_~x~0_185, main_#t~post1=|v_main_#t~post1_65|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {3732#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:18,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [100] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:18,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3746#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [99] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_67| |v_main_#t~post2_66|)) (.cse2 (= |v_main_#t~post3_122| |v_main_#t~post3_120|)) (.cse3 (= v_main_~y~0_207 v_main_~y~0_206)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183)) (.cse1 (<= 50 v_main_~x~0_184))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_207))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~y~0_206 v_main_~y~0_207) (= (+ v_main_~x~0_183 v_main_~y~0_206) (+ v_main_~x~0_184 v_main_~y~0_207)) (<= 0 v_main_~y~0_206)))) InVars {main_~y~0=v_main_~y~0_207, main_#t~post2=|v_main_#t~post2_67|, main_#t~post3=|v_main_#t~post3_122|, main_~x~0=v_main_~x~0_184} OutVars{main_~y~0=v_main_~y~0_206, main_#t~post2=|v_main_#t~post2_66|, main_#t~post3=|v_main_#t~post3_120|, main_~x~0=v_main_~x~0_183} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {3739#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:18,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {3746#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:18,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call #t~ret4 := main(); {3656#true} is VALID [2022-04-28 03:13:18,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3656#true} {3656#true} #61#return; {3656#true} is VALID [2022-04-28 03:13:18,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-04-28 03:13:18,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#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(9, 2); {3656#true} is VALID [2022-04-28 03:13:18,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {3656#true} call ULTIMATE.init(); {3656#true} is VALID [2022-04-28 03:13:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:18,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048150916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:18,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:19,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:19,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704903976] [2022-04-28 03:13:19,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704903976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:19,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:19,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:13:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964325336] [2022-04-28 03:13:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 40 [2022-04-28 03:13:19,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:19,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 03:13:19,229 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 03:13:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:13:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:13:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:13:19,229 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 03:13:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:20,066 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-28 03:13:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:13:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 40 [2022-04-28 03:13:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 03:13:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 03:13:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 03:13:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 03:13:20,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-28 03:13:20,103 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 03:13:20,103 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:13:20,104 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:13:20,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:13:20,104 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:20,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 88 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:13:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 03:13:20,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:20,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 03:13:20,187 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 03:13:20,187 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 03:13:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:20,188 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 03:13:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 03:13:20,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:20,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:20,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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) Second operand 51 states. [2022-04-28 03:13:20,188 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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) Second operand 51 states. [2022-04-28 03:13:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:20,189 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 03:13:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 03:13:20,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:20,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:20,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:20,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 03:13:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 03:13:20,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2022-04-28 03:13:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:20,190 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 03:13:20,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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 03:13:20,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 03:13:20,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 03:13:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:13:20,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:20,228 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:20,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 03:13:20,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 03:13:20,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1428585213, now seen corresponding path program 11 times [2022-04-28 03:13:20,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:20,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287799275] [2022-04-28 03:13:20,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:24,795 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:24,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:24,927 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1332182325, now seen corresponding path program 1 times [2022-04-28 03:13:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939833517] [2022-04-28 03:13:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-28 03:13:25,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:13:25,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-28 03:13:25,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:25,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {4156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4148#true} is VALID [2022-04-28 03:13:25,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:13:25,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-28 03:13:25,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-28 03:13:25,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4153#(= main_~x~0 0)} is VALID [2022-04-28 03:13:25,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {4153#(= main_~x~0 0)} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4153#(= main_~x~0 0)} is VALID [2022-04-28 03:13:25,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(= main_~x~0 0)} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4153#(= main_~x~0 0)} is VALID [2022-04-28 03:13:25,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(= main_~x~0 0)} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:25,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:25,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {4154#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4155#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:25,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {4155#(<= 48 main_~y~0)} assume ~y~0 < 0; {4149#false} is VALID [2022-04-28 03:13:25,009 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 03:13:25,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 03:13:25,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 03:13:25,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 03:13:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939833517] [2022-04-28 03:13:25,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939833517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482974126] [2022-04-28 03:13:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:25,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:13:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:25,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:25,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 03:13:25,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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(9, 2); {4148#true} is VALID [2022-04-28 03:13:25,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:13:25,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-28 03:13:25,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-28 03:13:25,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:25,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:25,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:25,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {4175#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:25,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:25,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {4185#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4192#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:25,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {4192#(<= 49 main_~y~0)} assume ~y~0 < 0; {4149#false} is VALID [2022-04-28 03:13:25,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 03:13:25,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 03:13:25,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 03:13:25,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 03:13:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:25,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:25,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 03:13:25,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 03:13:25,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 03:13:25,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {4149#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 03:13:25,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(not (< main_~y~0 0))} assume ~y~0 < 0; {4149#false} is VALID [2022-04-28 03:13:25,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4220#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:25,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} [102] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:25,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [105] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_237 v_main_~y~0_236)) (.cse3 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse4 (= |v_main_#t~post3_139| |v_main_#t~post3_135|)) (.cse5 (= |v_main_#t~post1_73| |v_main_#t~post1_72|)) (.cse0 (<= 0 (+ v_main_~y~0_237 1)))) (or (let ((.cse1 (+ v_main_~x~0_211 v_main_~y~0_236))) (and .cse0 (= .cse1 (+ v_main_~x~0_210 v_main_~y~0_237)) (< v_main_~y~0_237 v_main_~y~0_236) (< .cse1 (+ 51 v_main_~y~0_237)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_211 50)))))) InVars {main_~y~0=v_main_~y~0_237, main_#t~post3=|v_main_#t~post3_139|, main_~x~0=v_main_~x~0_211, main_#t~post1=|v_main_#t~post1_73|} OutVars{main_~y~0=v_main_~y~0_236, main_#t~post3=|v_main_#t~post3_135|, main_~x~0=v_main_~x~0_210, main_#t~post1=|v_main_#t~post1_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4224#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:25,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [104] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:25,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {4238#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [103] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_75| |v_main_#t~post2_74|)) (.cse1 (= |v_main_#t~post3_136| |v_main_#t~post3_134|)) (.cse2 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse3 (= v_main_~y~0_235 v_main_~y~0_234)) (.cse4 (<= 50 v_main_~x~0_209))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_235)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_209 v_main_~y~0_235))) (and (< v_main_~x~0_209 v_main_~x~0_208) (= (+ v_main_~x~0_208 v_main_~y~0_234) .cse5) .cse4 (<= v_main_~x~0_208 .cse5))))) InVars {main_~y~0=v_main_~y~0_235, main_#t~post2=|v_main_#t~post2_75|, main_#t~post3=|v_main_#t~post3_136|, main_~x~0=v_main_~x~0_209} OutVars{main_~y~0=v_main_~y~0_234, main_#t~post2=|v_main_#t~post2_74|, main_#t~post3=|v_main_#t~post3_134|, main_~x~0=v_main_~x~0_208} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4231#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:25,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4238#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:25,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret4 := main(); {4148#true} is VALID [2022-04-28 03:13:25,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #61#return; {4148#true} is VALID [2022-04-28 03:13:25,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:13:25,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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(9, 2); {4148#true} is VALID [2022-04-28 03:13:25,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 03:13:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:25,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482974126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:25,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:25,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:26,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:26,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287799275] [2022-04-28 03:13:26,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287799275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:26,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:13:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962642629] [2022-04-28 03:13:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:26,045 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 43 [2022-04-28 03:13:26,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:26,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 03:13:26,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:26,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:13:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:13:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:13:26,075 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 03:13:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:26,940 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-28 03:13:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:13:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 43 [2022-04-28 03:13:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 03:13:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2022-04-28 03:13:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 03:13:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2022-04-28 03:13:26,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 55 transitions. [2022-04-28 03:13:26,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:26,990 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:13:26,990 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 03:13:26,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:13:26,992 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:26,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 49 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:13:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 03:13:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 03:13:27,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:27,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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 03:13:27,075 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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 03:13:27,076 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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 03:13:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:27,076 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 03:13:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 03:13:27,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:27,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:27,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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) Second operand 54 states. [2022-04-28 03:13:27,077 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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) Second operand 54 states. [2022-04-28 03:13:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:27,077 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 03:13:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 03:13:27,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:27,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:27,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:27,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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 03:13:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-28 03:13:27,078 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2022-04-28 03:13:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:27,079 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-28 03:13:27,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 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 03:13:27,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2022-04-28 03:13:27,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-28 03:13:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:13:27,124 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:27,124 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:27,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:27,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 03:13:27,342 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1859809625, now seen corresponding path program 12 times [2022-04-28 03:13:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:27,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969505813] [2022-04-28 03:13:27,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:27,693 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:27,695 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1173201867, now seen corresponding path program 1 times [2022-04-28 03:13:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324619160] [2022-04-28 03:13:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:27,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-28 03:13:27,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-28 03:13:27,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-28 03:13:27,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:27,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {4672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4664#true} is VALID [2022-04-28 03:13:27,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-28 03:13:27,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-28 03:13:27,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-28 03:13:27,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:27,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:27,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:27,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {4669#(and (= main_~x~0 0) (= main_~y~0 0))} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:13:27,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:13:27,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#(or (= main_~x~0 0) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4671#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:27,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {4671#(<= 49 main_~y~0)} assume ~y~0 < 0; {4665#false} is VALID [2022-04-28 03:13:27,770 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-28 03:13:27,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-28 03:13:27,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-28 03:13:27,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-28 03:13:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:27,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324619160] [2022-04-28 03:13:27,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324619160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:27,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578218074] [2022-04-28 03:13:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:27,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:27,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:13:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:27,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:13:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:27,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:27,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4664#true} is VALID [2022-04-28 03:13:27,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#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(9, 2); {4664#true} is VALID [2022-04-28 03:13:27,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-28 03:13:27,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-28 03:13:27,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-28 03:13:27,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4691#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:27,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {4691#(<= main_~x~0 0)} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4691#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:27,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#(<= main_~x~0 0)} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4691#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:27,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#(<= main_~x~0 0)} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:27,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:27,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {4701#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4708#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:27,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {4708#(<= 48 main_~y~0)} assume ~y~0 < 0; {4665#false} is VALID [2022-04-28 03:13:27,947 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-28 03:13:27,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-28 03:13:27,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-28 03:13:27,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-28 03:13:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:27,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:28,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#false} assume !false; {4665#false} is VALID [2022-04-28 03:13:28,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#false} assume 0 == ~cond; {4665#false} is VALID [2022-04-28 03:13:28,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#false} ~cond := #in~cond; {4665#false} is VALID [2022-04-28 03:13:28,187 INFO L272 TraceCheckUtils]: 12: Hoare triple {4665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {4665#false} is VALID [2022-04-28 03:13:28,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {4736#(not (< main_~y~0 0))} assume ~y~0 < 0; {4665#false} is VALID [2022-04-28 03:13:28,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {4736#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:28,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} [106] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:28,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [109] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_266 1))) (.cse0 (= |v_main_#t~post3_153| |v_main_#t~post3_149|)) (.cse1 (= v_main_~y~0_266 v_main_~y~0_265)) (.cse2 (= v_main_~x~0_237 v_main_~x~0_236))) (or (and .cse0 .cse1 (= |v_main_#t~post1_80| |v_main_#t~post1_79|) .cse2) (and (= (+ v_main_~x~0_237 v_main_~y~0_265) (+ v_main_~x~0_236 v_main_~y~0_266)) (< v_main_~x~0_236 51) (< v_main_~x~0_237 v_main_~x~0_236) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_237 50))) (= |v_main_#t~post1_79| |v_main_#t~post1_80|) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post3=|v_main_#t~post3_153|, main_~x~0=v_main_~x~0_237, main_#t~post1=|v_main_#t~post1_80|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post3=|v_main_#t~post3_149|, main_~x~0=v_main_~x~0_236, main_#t~post1=|v_main_#t~post1_79|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {4740#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:28,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [108] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:28,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#(<= main_~x~0 48)} [107] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_82|)) (.cse2 (= v_main_~y~0_264 v_main_~y~0_263)) (.cse3 (= |v_main_#t~post3_150| |v_main_#t~post3_148|)) (.cse4 (<= 50 v_main_~x~0_235))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_264)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_235 v_main_~y~0_264))) (and (< v_main_~x~0_235 v_main_~x~0_234) .cse4 (<= v_main_~x~0_234 .cse5) (= .cse5 (+ v_main_~x~0_234 v_main_~y~0_263)))))) InVars {main_~y~0=v_main_~y~0_264, main_#t~post2=|v_main_#t~post2_83|, main_#t~post3=|v_main_#t~post3_150|, main_~x~0=v_main_~x~0_235} OutVars{main_~y~0=v_main_~y~0_263, main_#t~post2=|v_main_#t~post2_82|, main_#t~post3=|v_main_#t~post3_148|, main_~x~0=v_main_~x~0_234} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {4747#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:28,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {4754#(<= main_~x~0 48)} is VALID [2022-04-28 03:13:28,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {4664#true} call #t~ret4 := main(); {4664#true} is VALID [2022-04-28 03:13:28,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4664#true} {4664#true} #61#return; {4664#true} is VALID [2022-04-28 03:13:28,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {4664#true} assume true; {4664#true} is VALID [2022-04-28 03:13:28,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {4664#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(9, 2); {4664#true} is VALID [2022-04-28 03:13:28,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {4664#true} call ULTIMATE.init(); {4664#true} is VALID [2022-04-28 03:13:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:28,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578218074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:28,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:28,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:28,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:28,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969505813] [2022-04-28 03:13:28,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969505813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:28,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:28,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:13:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837010018] [2022-04-28 03:13:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 46 [2022-04-28 03:13:28,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:28,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 03:13:28,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:28,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:13:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:13:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:13:28,586 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 03:13:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:29,985 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-28 03:13:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:13:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 46 [2022-04-28 03:13:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 03:13:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2022-04-28 03:13:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 03:13:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2022-04-28 03:13:29,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 58 transitions. [2022-04-28 03:13:30,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:30,028 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:13:30,028 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:13:30,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=448, Invalid=2522, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:13:30,029 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:30,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 85 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:13:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:13:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-28 03:13:30,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:30,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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 03:13:30,130 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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 03:13:30,130 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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 03:13:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:30,131 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:13:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:13:30,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:30,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:30,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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) Second operand 57 states. [2022-04-28 03:13:30,131 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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) Second operand 57 states. [2022-04-28 03:13:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:30,132 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:13:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:13:30,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:30,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:30,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:30,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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 03:13:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 03:13:30,133 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2022-04-28 03:13:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:30,133 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 03:13:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 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 03:13:30,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 03:13:30,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 03:13:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:13:30,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:30,190 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:30,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 03:13:30,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 03:13:30,390 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2075882115, now seen corresponding path program 13 times [2022-04-28 03:13:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:30,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192498243] [2022-04-28 03:13:30,599 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:30,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:30,796 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -616381237, now seen corresponding path program 1 times [2022-04-28 03:13:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:30,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13625423] [2022-04-28 03:13:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:30,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-28 03:13:30,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-28 03:13:30,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-28 03:13:30,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:30,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {5217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-28 03:13:30,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-28 03:13:30,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-28 03:13:30,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-28 03:13:30,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5214#(= main_~x~0 0)} is VALID [2022-04-28 03:13:30,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {5214#(= main_~x~0 0)} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5214#(= main_~x~0 0)} is VALID [2022-04-28 03:13:30,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {5214#(= main_~x~0 0)} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5214#(= main_~x~0 0)} is VALID [2022-04-28 03:13:30,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {5214#(= main_~x~0 0)} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:30,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:30,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {5215#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5216#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:30,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {5216#(<= 48 main_~y~0)} assume ~y~0 < 0; {5210#false} is VALID [2022-04-28 03:13:30,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-28 03:13:30,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-28 03:13:30,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-28 03:13:30,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-28 03:13:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:30,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13625423] [2022-04-28 03:13:30,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13625423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:30,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988088928] [2022-04-28 03:13:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:30,876 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:30,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:13:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:30,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:30,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:31,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5209#true} is VALID [2022-04-28 03:13:31,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#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(9, 2); {5209#true} is VALID [2022-04-28 03:13:31,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-28 03:13:31,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-28 03:13:31,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-28 03:13:31,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:31,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:31,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:31,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {5236#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:31,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:31,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {5246#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5253#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:31,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {5253#(<= 49 main_~y~0)} assume ~y~0 < 0; {5210#false} is VALID [2022-04-28 03:13:31,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-28 03:13:31,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-28 03:13:31,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-28 03:13:31,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-28 03:13:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:31,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:31,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-28 03:13:31,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-28 03:13:31,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-28 03:13:31,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {5210#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5210#false} is VALID [2022-04-28 03:13:31,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {5281#(not (< main_~y~0 0))} assume ~y~0 < 0; {5210#false} is VALID [2022-04-28 03:13:31,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5281#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:31,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} [110] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:31,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [113] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_167| |v_main_#t~post3_163|)) (.cse2 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse3 (= |v_main_#t~post1_87| |v_main_#t~post1_86|)) (.cse4 (= v_main_~y~0_296 v_main_~y~0_295)) (.cse0 (<= 0 (+ v_main_~y~0_296 1)))) (or (and (or (not (< v_main_~x~0_264 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_263 51) (= (+ v_main_~x~0_264 v_main_~y~0_295) (+ v_main_~x~0_263 v_main_~y~0_296)) .cse0 (< v_main_~x~0_264 v_main_~x~0_263)))) InVars {main_~y~0=v_main_~y~0_296, main_#t~post3=|v_main_#t~post3_167|, main_~x~0=v_main_~x~0_264, main_#t~post1=|v_main_#t~post1_87|} OutVars{main_~y~0=v_main_~y~0_295, main_#t~post3=|v_main_#t~post3_163|, main_~x~0=v_main_~x~0_263, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5285#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:31,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [112] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:31,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [111] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_164| |v_main_#t~post3_162|)) (.cse1 (= |v_main_#t~post2_91| |v_main_#t~post2_90|)) (.cse2 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse3 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse4 (<= 50 v_main_~x~0_262))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_294)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_262 v_main_~y~0_294))) (and .cse4 (< v_main_~x~0_262 v_main_~x~0_261) (= (+ v_main_~x~0_261 v_main_~y~0_293) .cse5) (<= v_main_~x~0_261 .cse5))))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post2=|v_main_#t~post2_91|, main_#t~post3=|v_main_#t~post3_164|, main_~x~0=v_main_~x~0_262} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post2=|v_main_#t~post2_90|, main_#t~post3=|v_main_#t~post3_162|, main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5292#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:31,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5299#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:31,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret4 := main(); {5209#true} is VALID [2022-04-28 03:13:31,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #61#return; {5209#true} is VALID [2022-04-28 03:13:31,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-28 03:13:31,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#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(9, 2); {5209#true} is VALID [2022-04-28 03:13:31,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5209#true} is VALID [2022-04-28 03:13:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:31,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988088928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:31,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:31,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:31,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192498243] [2022-04-28 03:13:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192498243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:31,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:31,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:13:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933482157] [2022-04-28 03:13:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:31,988 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 49 [2022-04-28 03:13:31,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:31,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 03:13:32,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:32,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:13:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:13:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:13:32,022 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 03:13:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:33,363 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-28 03:13:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:13:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 49 [2022-04-28 03:13:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 03:13:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-28 03:13:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 03:13:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-28 03:13:33,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 61 transitions. [2022-04-28 03:13:33,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:33,409 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:13:33,409 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:13:33,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=2637, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:13:33,410 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:33,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 86 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:13:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:13:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 03:13:33,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:33,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 03:13:33,519 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 03:13:33,520 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 03:13:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:33,520 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 03:13:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 03:13:33,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:33,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:33,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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) Second operand 60 states. [2022-04-28 03:13:33,521 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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) Second operand 60 states. [2022-04-28 03:13:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:33,522 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 03:13:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 03:13:33,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:33,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:33,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:33,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 03:13:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 03:13:33,523 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 49 [2022-04-28 03:13:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:33,523 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 03:13:33,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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 03:13:33,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 03:13:33,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 03:13:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:13:33,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:33,584 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:33,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:33,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 03:13:33,785 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1956294951, now seen corresponding path program 14 times [2022-04-28 03:13:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414923598] [2022-04-28 03:13:34,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:34,209 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:34,210 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1889002955, now seen corresponding path program 1 times [2022-04-28 03:13:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:34,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498038461] [2022-04-28 03:13:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:34,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-28 03:13:34,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-28 03:13:34,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-28 03:13:34,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:34,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {5781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5773#true} is VALID [2022-04-28 03:13:34,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-28 03:13:34,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-28 03:13:34,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-28 03:13:34,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5778#(= main_~x~0 0)} is VALID [2022-04-28 03:13:34,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {5778#(= main_~x~0 0)} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5778#(= main_~x~0 0)} is VALID [2022-04-28 03:13:34,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {5778#(= main_~x~0 0)} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5778#(= main_~x~0 0)} is VALID [2022-04-28 03:13:34,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {5778#(= main_~x~0 0)} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:34,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:34,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {5779#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5780#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:34,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {5780#(<= 48 main_~y~0)} assume ~y~0 < 0; {5774#false} is VALID [2022-04-28 03:13:34,269 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-28 03:13:34,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-28 03:13:34,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-28 03:13:34,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-28 03:13:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:34,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498038461] [2022-04-28 03:13:34,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498038461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:34,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279667930] [2022-04-28 03:13:34,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:34,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:34,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:34,271 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:34,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:13:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:34,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:13:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:34,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:34,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2022-04-28 03:13:34,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#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(9, 2); {5773#true} is VALID [2022-04-28 03:13:34,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-28 03:13:34,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-28 03:13:34,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-28 03:13:34,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:34,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:34,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:34,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {5800#(and (<= main_~x~0 0) (= main_~y~0 0))} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:13:34,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:13:34,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {5810#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5817#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:34,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {5817#(<= 49 main_~y~0)} assume ~y~0 < 0; {5774#false} is VALID [2022-04-28 03:13:34,423 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-28 03:13:34,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-28 03:13:34,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-28 03:13:34,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-28 03:13:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:34,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:34,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2022-04-28 03:13:34,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2022-04-28 03:13:34,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2022-04-28 03:13:34,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {5774#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {5774#false} is VALID [2022-04-28 03:13:34,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {5845#(not (< main_~y~0 0))} assume ~y~0 < 0; {5774#false} is VALID [2022-04-28 03:13:34,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {5845#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:34,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} [114] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:34,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [117] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_327 1))) (.cse0 (= |v_main_#t~post1_94| |v_main_#t~post1_93|)) (.cse1 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse2 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_177| |v_main_#t~post3_181|) (or (not (< v_main_~x~0_292 50)) (not .cse3))) (and .cse3 (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 51) (= (+ v_main_~x~0_291 v_main_~y~0_327) (+ v_main_~x~0_292 v_main_~y~0_326))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_177|)))) InVars {main_~y~0=v_main_~y~0_327, main_#t~post3=|v_main_#t~post3_181|, main_~x~0=v_main_~x~0_292, main_#t~post1=|v_main_#t~post1_94|} OutVars{main_~y~0=v_main_~y~0_326, main_#t~post3=|v_main_#t~post3_177|, main_~x~0=v_main_~x~0_291, main_#t~post1=|v_main_#t~post1_93|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {5849#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:34,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [116] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:34,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {5863#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [115] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post2_99| |v_main_#t~post2_98|)) (.cse2 (= |v_main_#t~post3_178| |v_main_#t~post3_176|)) (.cse3 (<= 50 v_main_~x~0_290))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_290 v_main_~x~0_289)) (and .cse0 .cse1 (or (not .cse3) (not (<= 1 v_main_~y~0_325))) .cse2 (= v_main_~x~0_289 v_main_~x~0_290)) (let ((.cse4 (+ v_main_~x~0_290 v_main_~y~0_325))) (and (= .cse4 (+ v_main_~x~0_289 v_main_~y~0_324)) (< v_main_~x~0_290 v_main_~x~0_289) (<= v_main_~x~0_289 .cse4) .cse3)))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post2=|v_main_#t~post2_99|, main_#t~post3=|v_main_#t~post3_178|, main_~x~0=v_main_~x~0_290} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post2=|v_main_#t~post2_98|, main_#t~post3=|v_main_#t~post3_176|, main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {5856#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:34,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {5773#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {5863#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:13:34,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {5773#true} call #t~ret4 := main(); {5773#true} is VALID [2022-04-28 03:13:34,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5773#true} {5773#true} #61#return; {5773#true} is VALID [2022-04-28 03:13:34,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {5773#true} assume true; {5773#true} is VALID [2022-04-28 03:13:34,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {5773#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(9, 2); {5773#true} is VALID [2022-04-28 03:13:34,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2022-04-28 03:13:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:34,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279667930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:34,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:34,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:35,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:35,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414923598] [2022-04-28 03:13:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414923598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:13:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546140258] [2022-04-28 03:13:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 52 [2022-04-28 03:13:35,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:35,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 03:13:35,077 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 03:13:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:13:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:13:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:13:35,087 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 03:13:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:36,902 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-04-28 03:13:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:13:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 52 [2022-04-28 03:13:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 03:13:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 64 transitions. [2022-04-28 03:13:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 03:13:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 64 transitions. [2022-04-28 03:13:36,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 64 transitions. [2022-04-28 03:13:36,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:36,952 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:13:36,952 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:13:36,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:13:36,953 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:36,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:13:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:13:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 03:13:37,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:37,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 03:13:37,073 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 03:13:37,073 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 03:13:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:37,074 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:13:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:13:37,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:37,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:37,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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) Second operand 63 states. [2022-04-28 03:13:37,074 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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) Second operand 63 states. [2022-04-28 03:13:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:37,075 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:13:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:13:37,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:37,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:37,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:37,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 03:13:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-28 03:13:37,076 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 52 [2022-04-28 03:13:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:37,076 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-28 03:13:37,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 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 03:13:37,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-28 03:13:37,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 03:13:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:13:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:37,142 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:37,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:37,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 03:13:37,342 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -137019389, now seen corresponding path program 15 times [2022-04-28 03:13:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:37,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029100833] [2022-04-28 03:13:41,483 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:41,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:41,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:41,778 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 99419851, now seen corresponding path program 1 times [2022-04-28 03:13:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918524853] [2022-04-28 03:13:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:41,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-28 03:13:41,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-28 03:13:41,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-28 03:13:41,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:41,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {6370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6361#true} is VALID [2022-04-28 03:13:41,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-28 03:13:41,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-28 03:13:41,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-28 03:13:41,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6366#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:13:41,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {6366#(and (= main_~x~0 0) (= main_~y~0 0))} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:41,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:41,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {6367#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:13:41,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:13:41,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#(or (<= main_~x~0 49) (<= main_~x~0 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6369#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:41,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {6369#(<= 49 main_~y~0)} assume ~y~0 < 0; {6362#false} is VALID [2022-04-28 03:13:41,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-28 03:13:41,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-28 03:13:41,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-28 03:13:41,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-28 03:13:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918524853] [2022-04-28 03:13:41,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918524853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872289196] [2022-04-28 03:13:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:41,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:13:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:41,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:13:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:41,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:42,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6361#true} is VALID [2022-04-28 03:13:42,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#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(9, 2); {6361#true} is VALID [2022-04-28 03:13:42,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-28 03:13:42,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-28 03:13:42,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-28 03:13:42,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6389#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:42,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {6389#(<= main_~x~0 0)} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6389#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:42,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {6389#(<= main_~x~0 0)} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6389#(<= main_~x~0 0)} is VALID [2022-04-28 03:13:42,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {6389#(<= main_~x~0 0)} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:42,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:13:42,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {6399#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6406#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:42,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {6406#(<= 48 main_~y~0)} assume ~y~0 < 0; {6362#false} is VALID [2022-04-28 03:13:42,058 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-28 03:13:42,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-28 03:13:42,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-28 03:13:42,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-28 03:13:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:42,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:42,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-04-28 03:13:42,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {6362#false} assume 0 == ~cond; {6362#false} is VALID [2022-04-28 03:13:42,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {6362#false} ~cond := #in~cond; {6362#false} is VALID [2022-04-28 03:13:42,458 INFO L272 TraceCheckUtils]: 12: Hoare triple {6362#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6362#false} is VALID [2022-04-28 03:13:42,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {6434#(not (< main_~y~0 0))} assume ~y~0 < 0; {6362#false} is VALID [2022-04-28 03:13:42,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6434#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:42,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} [118] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:42,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [121] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_321 v_main_~x~0_320)) (.cse3 (= |v_main_#t~post1_101| |v_main_#t~post1_100|)) (.cse0 (<= 0 (+ v_main_~y~0_359 1))) (.cse4 (= v_main_~y~0_359 v_main_~y~0_358))) (or (let ((.cse1 (+ v_main_~x~0_321 v_main_~y~0_358))) (and (< v_main_~y~0_359 v_main_~y~0_358) .cse0 (< .cse1 (+ 51 v_main_~y~0_359)) (= .cse1 (+ v_main_~x~0_320 v_main_~y~0_359)))) (and .cse2 (= |v_main_#t~post3_195| |v_main_#t~post3_191|) .cse3 .cse4) (and .cse2 (= |v_main_#t~post3_191| |v_main_#t~post3_195|) .cse3 (or (not .cse0) (not (< v_main_~x~0_321 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_359, main_#t~post3=|v_main_#t~post3_195|, main_~x~0=v_main_~x~0_321, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~y~0=v_main_~y~0_358, main_#t~post3=|v_main_#t~post3_191|, main_~x~0=v_main_~x~0_320, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6438#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:42,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [120] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:42,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {6452#(<= main_~x~0 48)} [119] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_319 v_main_~x~0_318)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post3_192| |v_main_#t~post3_190|)) (.cse5 (= |v_main_#t~post2_107| |v_main_#t~post2_106|)) (.cse0 (<= 50 v_main_~x~0_319))) (or (let ((.cse1 (+ v_main_~x~0_319 v_main_~y~0_357))) (and .cse0 (= .cse1 (+ v_main_~x~0_318 v_main_~y~0_356)) (<= v_main_~x~0_318 .cse1) (< v_main_~x~0_319 v_main_~x~0_318))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (<= 1 v_main_~y~0_357)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post2=|v_main_#t~post2_107|, main_#t~post3=|v_main_#t~post3_192|, main_~x~0=v_main_~x~0_319} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post2=|v_main_#t~post2_106|, main_#t~post3=|v_main_#t~post3_190|, main_~x~0=v_main_~x~0_318} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6445#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:42,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6452#(<= main_~x~0 48)} is VALID [2022-04-28 03:13:42,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {6361#true} call #t~ret4 := main(); {6361#true} is VALID [2022-04-28 03:13:42,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6361#true} {6361#true} #61#return; {6361#true} is VALID [2022-04-28 03:13:42,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume true; {6361#true} is VALID [2022-04-28 03:13:42,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#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(9, 2); {6361#true} is VALID [2022-04-28 03:13:42,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {6361#true} call ULTIMATE.init(); {6361#true} is VALID [2022-04-28 03:13:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:42,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872289196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:42,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:42,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:13:42,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029100833] [2022-04-28 03:13:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029100833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:42,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:13:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191663436] [2022-04-28 03:13:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 55 [2022-04-28 03:13:42,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:42,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 03:13:42,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:13:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:13:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1291, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:13:42,931 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 03:13:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,035 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-04-28 03:13:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:13:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 55 [2022-04-28 03:13:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 03:13:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. [2022-04-28 03:13:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 03:13:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 67 transitions. [2022-04-28 03:13:45,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 67 transitions. [2022-04-28 03:13:45,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:45,096 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:13:45,096 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:13:45,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=575, Invalid=3981, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:13:45,097 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:45,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:13:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:13:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:13:45,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:45,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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 03:13:45,186 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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 03:13:45,186 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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 03:13:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,187 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-28 03:13:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-28 03:13:45,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:45,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:45,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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) Second operand 65 states. [2022-04-28 03:13:45,187 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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) Second operand 65 states. [2022-04-28 03:13:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:45,188 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-28 03:13:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-28 03:13:45,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:45,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:45,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:45,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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 03:13:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-04-28 03:13:45,189 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 55 [2022-04-28 03:13:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:45,189 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-04-28 03:13:45,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 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 03:13:45,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 69 transitions. [2022-04-28 03:13:45,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-28 03:13:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:13:45,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:45,265 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:45,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:45,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:45,481 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 860615591, now seen corresponding path program 16 times [2022-04-28 03:13:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:45,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320375168] [2022-04-28 03:13:45,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:45,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:45,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1690163253, now seen corresponding path program 1 times [2022-04-28 03:13:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315146376] [2022-04-28 03:13:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:45,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-28 03:13:45,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-28 03:13:45,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-28 03:13:45,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:45,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6975#true} is VALID [2022-04-28 03:13:45,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-28 03:13:45,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-28 03:13:45,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-28 03:13:45,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {6980#(= main_~x~0 0)} is VALID [2022-04-28 03:13:45,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {6980#(= main_~x~0 0)} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {6980#(= main_~x~0 0)} is VALID [2022-04-28 03:13:45,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {6980#(= main_~x~0 0)} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6980#(= main_~x~0 0)} is VALID [2022-04-28 03:13:45,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#(= main_~x~0 0)} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:45,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:13:45,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {6982#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:45,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {6982#(<= 48 main_~y~0)} assume ~y~0 < 0; {6976#false} is VALID [2022-04-28 03:13:45,988 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-28 03:13:45,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-28 03:13:45,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-28 03:13:45,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-28 03:13:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315146376] [2022-04-28 03:13:45,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315146376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201160919] [2022-04-28 03:13:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:45,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:45,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:45,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:13:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:46,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:46,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6975#true} is VALID [2022-04-28 03:13:46,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#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(9, 2); {6975#true} is VALID [2022-04-28 03:13:46,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-28 03:13:46,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-28 03:13:46,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-28 03:13:46,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:46,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:46,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:46,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {7002#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:46,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:46,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {7012#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7019#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:46,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {7019#(<= 49 main_~y~0)} assume ~y~0 < 0; {6976#false} is VALID [2022-04-28 03:13:46,280 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-28 03:13:46,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-28 03:13:46,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-28 03:13:46,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-28 03:13:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:46,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:46,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#false} assume !false; {6976#false} is VALID [2022-04-28 03:13:46,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#false} assume 0 == ~cond; {6976#false} is VALID [2022-04-28 03:13:46,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#false} ~cond := #in~cond; {6976#false} is VALID [2022-04-28 03:13:46,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {6976#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {6976#false} is VALID [2022-04-28 03:13:46,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {7047#(not (< main_~y~0 0))} assume ~y~0 < 0; {6976#false} is VALID [2022-04-28 03:13:46,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7047#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:46,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} [122] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:46,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [125] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post3_209| |v_main_#t~post3_205|)) (.cse3 (= |v_main_#t~post1_108| |v_main_#t~post1_107|)) (.cse4 (= v_main_~x~0_351 v_main_~x~0_350)) (.cse2 (<= 0 (+ v_main_~y~0_392 1)))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_351 50)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_351 v_main_~y~0_391))) (and (< v_main_~y~0_392 v_main_~y~0_391) (< .cse5 (+ 51 v_main_~y~0_392)) (= .cse5 (+ v_main_~x~0_350 v_main_~y~0_392)) .cse2)))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post3=|v_main_#t~post3_209|, main_~x~0=v_main_~x~0_351, main_#t~post1=|v_main_#t~post1_108|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post3=|v_main_#t~post3_205|, main_~x~0=v_main_~x~0_350, main_#t~post1=|v_main_#t~post1_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7051#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:46,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [124] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:46,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {7065#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [123] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_115| |v_main_#t~post2_114|)) (.cse1 (= |v_main_#t~post3_206| |v_main_#t~post3_204|)) (.cse2 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse3 (<= 50 v_main_~x~0_349))) (or (and (= v_main_~y~0_390 v_main_~y~0_389) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_348 v_main_~y~0_389) (+ v_main_~x~0_349 v_main_~y~0_390)) (< v_main_~y~0_389 v_main_~y~0_390) (<= 0 v_main_~y~0_389) .cse3) (and .cse0 (= v_main_~y~0_389 v_main_~y~0_390) .cse1 .cse2 (or (not (<= 1 v_main_~y~0_390)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_390, main_#t~post2=|v_main_#t~post2_115|, main_#t~post3=|v_main_#t~post3_206|, main_~x~0=v_main_~x~0_349} OutVars{main_~y~0=v_main_~y~0_389, main_#t~post2=|v_main_#t~post2_114|, main_#t~post3=|v_main_#t~post3_204|, main_~x~0=v_main_~x~0_348} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7058#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:46,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {6975#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7065#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:13:46,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {6975#true} call #t~ret4 := main(); {6975#true} is VALID [2022-04-28 03:13:46,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6975#true} {6975#true} #61#return; {6975#true} is VALID [2022-04-28 03:13:46,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {6975#true} assume true; {6975#true} is VALID [2022-04-28 03:13:46,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {6975#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(9, 2); {6975#true} is VALID [2022-04-28 03:13:46,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {6975#true} call ULTIMATE.init(); {6975#true} is VALID [2022-04-28 03:13:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:46,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201160919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:46,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:46,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:47,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:47,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320375168] [2022-04-28 03:13:47,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320375168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:47,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:47,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:13:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54141316] [2022-04-28 03:13:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 58 [2022-04-28 03:13:47,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:47,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 03:13:47,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:47,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:13:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:13:47,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:13:47,129 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 03:13:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:48,803 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-28 03:13:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:13:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 58 [2022-04-28 03:13:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 03:13:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-04-28 03:13:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 03:13:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-04-28 03:13:48,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 70 transitions. [2022-04-28 03:13:48,843 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 03:13:48,844 INFO L225 Difference]: With dead ends: 84 [2022-04-28 03:13:48,844 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:13:48,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=554, Invalid=4002, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:13:48,846 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:48,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 144 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:13:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:13:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 03:13:48,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:48,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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 03:13:48,943 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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 03:13:48,943 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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 03:13:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:48,944 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:13:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:13:48,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:48,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:48,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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) Second operand 69 states. [2022-04-28 03:13:48,944 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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) Second operand 69 states. [2022-04-28 03:13:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:48,947 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:13:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:13:48,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:48,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:48,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:48,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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 03:13:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 03:13:48,949 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 58 [2022-04-28 03:13:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:48,949 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 03:13:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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 03:13:48,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 03:13:49,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:13:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:13:49,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:49,035 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:49,250 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 230616451, now seen corresponding path program 17 times [2022-04-28 03:13:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:49,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983130956] [2022-04-28 03:13:49,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:49,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:49,563 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 815220939, now seen corresponding path program 1 times [2022-04-28 03:13:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:49,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301831725] [2022-04-28 03:13:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:49,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {7619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-28 03:13:49,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-28 03:13:49,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7616#(= main_~x~0 0)} is VALID [2022-04-28 03:13:49,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {7616#(= main_~x~0 0)} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7616#(= main_~x~0 0)} is VALID [2022-04-28 03:13:49,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {7616#(= main_~x~0 0)} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7616#(= main_~x~0 0)} is VALID [2022-04-28 03:13:49,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {7616#(= main_~x~0 0)} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:49,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:49,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {7617#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7618#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:49,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {7618#(<= 48 main_~y~0)} assume ~y~0 < 0; {7612#false} is VALID [2022-04-28 03:13:49,596 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-28 03:13:49,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-28 03:13:49,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-28 03:13:49,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-28 03:13:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:49,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301831725] [2022-04-28 03:13:49,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301831725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:49,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333010203] [2022-04-28 03:13:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:49,597 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:49,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:13:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:49,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:49,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:49,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2022-04-28 03:13:49,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#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(9, 2); {7611#true} is VALID [2022-04-28 03:13:49,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-28 03:13:49,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-28 03:13:49,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-28 03:13:49,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:49,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:49,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:49,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {7638#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:49,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:49,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {7648#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7655#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:49,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {7655#(<= 49 main_~y~0)} assume ~y~0 < 0; {7612#false} is VALID [2022-04-28 03:13:49,883 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-28 03:13:49,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-28 03:13:49,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-28 03:13:49,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-28 03:13:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:49,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:50,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#false} assume !false; {7612#false} is VALID [2022-04-28 03:13:50,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#false} assume 0 == ~cond; {7612#false} is VALID [2022-04-28 03:13:50,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#false} ~cond := #in~cond; {7612#false} is VALID [2022-04-28 03:13:50,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {7612#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {7612#false} is VALID [2022-04-28 03:13:50,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {7683#(not (< main_~y~0 0))} assume ~y~0 < 0; {7612#false} is VALID [2022-04-28 03:13:50,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {7683#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:50,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} [126] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:50,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [129] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post1_115| |v_main_#t~post1_114|)) (.cse3 (= v_main_~x~0_382 v_main_~x~0_381)) (.cse0 (<= 0 (+ v_main_~y~0_426 1))) (.cse4 (= v_main_~y~0_426 v_main_~y~0_425))) (or (let ((.cse1 (+ v_main_~x~0_382 v_main_~y~0_425))) (and (< v_main_~y~0_426 v_main_~y~0_425) .cse0 (< .cse1 (+ 51 v_main_~y~0_426)) (= .cse1 (+ v_main_~x~0_381 v_main_~y~0_426)))) (and .cse2 (= |v_main_#t~post3_223| |v_main_#t~post3_219|) .cse3 .cse4) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_382 50))) (= |v_main_#t~post3_219| |v_main_#t~post3_223|) .cse4))) InVars {main_~y~0=v_main_~y~0_426, main_#t~post3=|v_main_#t~post3_223|, main_~x~0=v_main_~x~0_382, main_#t~post1=|v_main_#t~post1_115|} OutVars{main_~y~0=v_main_~y~0_425, main_#t~post3=|v_main_#t~post3_219|, main_~x~0=v_main_~x~0_381, main_#t~post1=|v_main_#t~post1_114|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {7687#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:50,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [128] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:50,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {7701#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [127] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_380)) (.cse0 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse1 (= v_main_~y~0_424 v_main_~y~0_423)) (.cse2 (= |v_main_#t~post2_123| |v_main_#t~post2_122|))) (or (and (= |v_main_#t~post3_220| |v_main_#t~post3_218|) .cse0 .cse1 .cse2) (and (<= 0 v_main_~y~0_423) (= (+ v_main_~x~0_379 v_main_~y~0_423) (+ v_main_~x~0_380 v_main_~y~0_424)) (< v_main_~y~0_423 v_main_~y~0_424) .cse3) (and (or (not .cse3) (not (<= 1 v_main_~y~0_424))) .cse0 .cse1 (= |v_main_#t~post3_218| |v_main_#t~post3_220|) .cse2))) InVars {main_~y~0=v_main_~y~0_424, main_#t~post2=|v_main_#t~post2_123|, main_#t~post3=|v_main_#t~post3_220|, main_~x~0=v_main_~x~0_380} OutVars{main_~y~0=v_main_~y~0_423, main_#t~post2=|v_main_#t~post2_122|, main_#t~post3=|v_main_#t~post3_218|, main_~x~0=v_main_~x~0_379} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {7694#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:50,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {7611#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {7701#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:50,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {7611#true} call #t~ret4 := main(); {7611#true} is VALID [2022-04-28 03:13:50,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7611#true} {7611#true} #61#return; {7611#true} is VALID [2022-04-28 03:13:50,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {7611#true} assume true; {7611#true} is VALID [2022-04-28 03:13:50,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#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(9, 2); {7611#true} is VALID [2022-04-28 03:13:50,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {7611#true} call ULTIMATE.init(); {7611#true} is VALID [2022-04-28 03:13:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:50,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333010203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:50,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:50,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:50,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:50,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983130956] [2022-04-28 03:13:50,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983130956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:50,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:50,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:13:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171122220] [2022-04-28 03:13:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 61 [2022-04-28 03:13:50,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:50,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 03:13:51,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:51,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:13:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:13:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:13:51,023 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 03:13:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,609 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-28 03:13:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:13:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 61 [2022-04-28 03:13:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 03:13:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2022-04-28 03:13:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 03:13:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2022-04-28 03:13:52,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 73 transitions. [2022-04-28 03:13:52,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:52,666 INFO L225 Difference]: With dead ends: 87 [2022-04-28 03:13:52,666 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:13:52,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=4521, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 03:13:52,667 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:52,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 125 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:13:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:13:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-28 03:13:52,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:52,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 03:13:52,813 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 03:13:52,813 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 03:13:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,814 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-28 03:13:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-28 03:13:52,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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) Second operand 72 states. [2022-04-28 03:13:52,814 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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) Second operand 72 states. [2022-04-28 03:13:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:52,815 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-28 03:13:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-28 03:13:52,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:52,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:52,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:52,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 03:13:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-28 03:13:52,816 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 61 [2022-04-28 03:13:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:52,816 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-28 03:13:52,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 03:13:52,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2022-04-28 03:13:52,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:13:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:13:52,892 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:52,892 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:52,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:53,093 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 933320231, now seen corresponding path program 18 times [2022-04-28 03:13:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497502073] [2022-04-28 03:13:53,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:53,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:53,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -974362165, now seen corresponding path program 1 times [2022-04-28 03:13:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:53,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141272330] [2022-04-28 03:13:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:53,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-28 03:13:53,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-28 03:13:53,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-28 03:13:53,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:53,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {8279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8271#true} is VALID [2022-04-28 03:13:53,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-28 03:13:53,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-28 03:13:53,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-28 03:13:53,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8276#(= main_~x~0 0)} is VALID [2022-04-28 03:13:53,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {8276#(= main_~x~0 0)} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8276#(= main_~x~0 0)} is VALID [2022-04-28 03:13:53,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {8276#(= main_~x~0 0)} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8276#(= main_~x~0 0)} is VALID [2022-04-28 03:13:53,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {8276#(= main_~x~0 0)} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:53,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:53,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {8277#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8278#(<= 48 main_~y~0)} is VALID [2022-04-28 03:13:53,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {8278#(<= 48 main_~y~0)} assume ~y~0 < 0; {8272#false} is VALID [2022-04-28 03:13:53,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-28 03:13:53,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-28 03:13:53,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-28 03:13:53,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-28 03:13:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141272330] [2022-04-28 03:13:53,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141272330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:13:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453833267] [2022-04-28 03:13:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:53,628 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:13:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:53,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:13:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:53,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:13:53,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2022-04-28 03:13:53,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#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(9, 2); {8271#true} is VALID [2022-04-28 03:13:53,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-28 03:13:53,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-28 03:13:53,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-28 03:13:53,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:53,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:53,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:13:53,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {8298#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:53,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:13:53,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {8308#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8315#(<= 49 main_~y~0)} is VALID [2022-04-28 03:13:53,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {8315#(<= 49 main_~y~0)} assume ~y~0 < 0; {8272#false} is VALID [2022-04-28 03:13:53,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-28 03:13:53,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-28 03:13:53,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-28 03:13:53,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-28 03:13:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:13:53,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:13:54,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {8272#false} assume !false; {8272#false} is VALID [2022-04-28 03:13:54,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {8272#false} assume 0 == ~cond; {8272#false} is VALID [2022-04-28 03:13:54,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {8272#false} ~cond := #in~cond; {8272#false} is VALID [2022-04-28 03:13:54,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {8272#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8272#false} is VALID [2022-04-28 03:13:54,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {8343#(not (< main_~y~0 0))} assume ~y~0 < 0; {8272#false} is VALID [2022-04-28 03:13:54,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8343#(not (< main_~y~0 0))} is VALID [2022-04-28 03:13:54,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} [130] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:54,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [133] L28-2-->L29_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_237| |v_main_#t~post3_233|)) (.cse3 (= |v_main_#t~post1_122| |v_main_#t~post1_121|)) (.cse4 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse5 (= v_main_~y~0_461 v_main_~y~0_460)) (.cse1 (<= 0 (+ v_main_~y~0_461 1)))) (or (let ((.cse0 (+ v_main_~x~0_414 v_main_~y~0_460))) (and (< v_main_~y~0_461 v_main_~y~0_460) (= .cse0 (+ v_main_~x~0_413 v_main_~y~0_461)) (< .cse0 (+ 51 v_main_~y~0_461)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_414 50)) (not .cse1))))) InVars {main_~y~0=v_main_~y~0_461, main_#t~post3=|v_main_#t~post3_237|, main_~x~0=v_main_~x~0_414, main_#t~post1=|v_main_#t~post1_122|} OutVars{main_~y~0=v_main_~y~0_460, main_#t~post3=|v_main_#t~post3_233|, main_~x~0=v_main_~x~0_413, main_#t~post1=|v_main_#t~post1_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8347#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:13:54,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [132] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:54,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {8361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [131] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse1 (= |v_main_#t~post2_131| |v_main_#t~post2_130|)) (.cse2 (= |v_main_#t~post3_234| |v_main_#t~post3_232|)) (.cse3 (= v_main_~x~0_412 v_main_~x~0_411)) (.cse4 (<= 50 v_main_~x~0_412))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_459)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_412 v_main_~y~0_459))) (and (<= v_main_~x~0_411 .cse5) (= (+ v_main_~x~0_411 v_main_~y~0_458) .cse5) .cse4 (< v_main_~x~0_412 v_main_~x~0_411))))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post2=|v_main_#t~post2_131|, main_#t~post3=|v_main_#t~post3_234|, main_~x~0=v_main_~x~0_412} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post2=|v_main_#t~post2_130|, main_#t~post3=|v_main_#t~post3_232|, main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8354#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:13:54,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {8271#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:13:54,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {8271#true} call #t~ret4 := main(); {8271#true} is VALID [2022-04-28 03:13:54,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8271#true} {8271#true} #61#return; {8271#true} is VALID [2022-04-28 03:13:54,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {8271#true} assume true; {8271#true} is VALID [2022-04-28 03:13:54,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#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(9, 2); {8271#true} is VALID [2022-04-28 03:13:54,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {8271#true} call ULTIMATE.init(); {8271#true} is VALID [2022-04-28 03:13:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:54,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453833267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:13:54,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:13:54,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:13:55,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:55,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497502073] [2022-04-28 03:13:55,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497502073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:55,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:55,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:13:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529555940] [2022-04-28 03:13:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 64 [2022-04-28 03:13:55,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:55,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 03:13:55,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:55,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:13:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:13:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:13:55,213 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 03:13:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:57,751 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-28 03:13:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:13:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 64 [2022-04-28 03:13:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 03:13:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2022-04-28 03:13:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 03:13:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2022-04-28 03:13:57,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 76 transitions. [2022-04-28 03:13:57,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:57,815 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:13:57,815 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:13:57,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=628, Invalid=5072, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:13:57,816 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:57,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 66 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:13:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:13:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-04-28 03:13:57,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:57,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 03:13:57,979 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 03:13:57,979 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 03:13:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:57,980 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 03:13:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 03:13:57,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:57,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:57,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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) Second operand 75 states. [2022-04-28 03:13:57,980 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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) Second operand 75 states. [2022-04-28 03:13:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:57,981 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 03:13:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 03:13:57,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:57,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:57,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:57,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 03:13:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-04-28 03:13:57,982 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 64 [2022-04-28 03:13:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:57,982 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-04-28 03:13:57,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 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 03:13:57,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2022-04-28 03:13:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-04-28 03:13:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:13:58,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:58,060 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:58,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:13:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:58,261 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1511029507, now seen corresponding path program 19 times [2022-04-28 03:13:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:58,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105580059] [2022-04-28 03:13:58,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:02,593 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:02,692 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:02,693 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1531022027, now seen corresponding path program 1 times [2022-04-28 03:14:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:02,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131556967] [2022-04-28 03:14:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:02,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-28 03:14:02,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:02,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {8963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-28 03:14:02,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8960#(= main_~x~0 0)} is VALID [2022-04-28 03:14:02,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {8960#(= main_~x~0 0)} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8960#(= main_~x~0 0)} is VALID [2022-04-28 03:14:02,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {8960#(= main_~x~0 0)} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8960#(= main_~x~0 0)} is VALID [2022-04-28 03:14:02,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {8960#(= main_~x~0 0)} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:02,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:02,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {8961#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8962#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:02,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {8962#(<= 48 main_~y~0)} assume ~y~0 < 0; {8956#false} is VALID [2022-04-28 03:14:02,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 03:14:02,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 03:14:02,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 03:14:02,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 03:14:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:02,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131556967] [2022-04-28 03:14:02,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131556967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:02,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036091385] [2022-04-28 03:14:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:02,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:02,744 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:02,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:14:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:02,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:14:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:02,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:03,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 03:14:03,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#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(9, 2); {8955#true} is VALID [2022-04-28 03:14:03,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 03:14:03,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-28 03:14:03,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-28 03:14:03,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:03,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:03,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:03,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {8982#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:14:03,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:14:03,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {8992#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {8999#(<= 49 main_~y~0)} is VALID [2022-04-28 03:14:03,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {8999#(<= 49 main_~y~0)} assume ~y~0 < 0; {8956#false} is VALID [2022-04-28 03:14:03,051 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 03:14:03,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 03:14:03,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 03:14:03,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 03:14:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:03,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:03,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 03:14:03,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 03:14:03,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 03:14:03,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {8956#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-28 03:14:03,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {9027#(not (< main_~y~0 0))} assume ~y~0 < 0; {8956#false} is VALID [2022-04-28 03:14:03,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9027#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:03,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} [134] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:03,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [137] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse2 (= |v_main_#t~post3_251| |v_main_#t~post3_247|)) (.cse3 (= |v_main_#t~post1_129| |v_main_#t~post1_128|)) (.cse4 (= v_main_~y~0_497 v_main_~y~0_496)) (.cse1 (<= 0 (+ v_main_~y~0_497 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_447 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_446 51) (< v_main_~x~0_447 v_main_~x~0_446) (= (+ v_main_~x~0_447 v_main_~y~0_496) (+ v_main_~x~0_446 v_main_~y~0_497))))) InVars {main_~y~0=v_main_~y~0_497, main_#t~post3=|v_main_#t~post3_251|, main_~x~0=v_main_~x~0_447, main_#t~post1=|v_main_#t~post1_129|} OutVars{main_~y~0=v_main_~y~0_496, main_#t~post3=|v_main_#t~post3_247|, main_~x~0=v_main_~x~0_446, main_#t~post1=|v_main_#t~post1_128|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9031#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:03,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [136] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:03,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {9045#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [135] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse1 (= |v_main_#t~post3_248| |v_main_#t~post3_246|)) (.cse2 (= v_main_~y~0_495 v_main_~y~0_494)) (.cse3 (= |v_main_#t~post2_139| |v_main_#t~post2_138|)) (.cse4 (<= 50 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (<= 1 v_main_~y~0_495))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_494 v_main_~y~0_495) (= (+ v_main_~x~0_444 v_main_~y~0_494) (+ v_main_~x~0_445 v_main_~y~0_495)) (<= 0 v_main_~y~0_494) .cse4))) InVars {main_~y~0=v_main_~y~0_495, main_#t~post2=|v_main_#t~post2_139|, main_#t~post3=|v_main_#t~post3_248|, main_~x~0=v_main_~x~0_445} OutVars{main_~y~0=v_main_~y~0_494, main_#t~post2=|v_main_#t~post2_138|, main_#t~post3=|v_main_#t~post3_246|, main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9038#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:03,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9045#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:14:03,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret4 := main(); {8955#true} is VALID [2022-04-28 03:14:03,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #61#return; {8955#true} is VALID [2022-04-28 03:14:03,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 03:14:03,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#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(9, 2); {8955#true} is VALID [2022-04-28 03:14:03,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 03:14:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:03,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036091385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:03,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:03,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:14:04,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105580059] [2022-04-28 03:14:04,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105580059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:04,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:04,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:14:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480390685] [2022-04-28 03:14:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 67 [2022-04-28 03:14:04,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:04,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 03:14:04,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:04,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:14:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:14:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:14:04,261 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 03:14:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:06,902 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-28 03:14:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:14:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 67 [2022-04-28 03:14:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 03:14:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-28 03:14:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 03:14:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-28 03:14:06,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 79 transitions. [2022-04-28 03:14:06,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:06,962 INFO L225 Difference]: With dead ends: 93 [2022-04-28 03:14:06,962 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 03:14:06,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=665, Invalid=5655, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 03:14:06,964 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:06,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 62 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:14:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 03:14:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-28 03:14:07,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:07,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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 03:14:07,143 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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 03:14:07,143 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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 03:14:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:07,144 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-28 03:14:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-28 03:14:07,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:07,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:07,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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) Second operand 78 states. [2022-04-28 03:14:07,145 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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) Second operand 78 states. [2022-04-28 03:14:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:07,145 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-28 03:14:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-28 03:14:07,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:07,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:07,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:07,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 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 03:14:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-04-28 03:14:07,147 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 67 [2022-04-28 03:14:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:07,147 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-04-28 03:14:07,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 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 03:14:07,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2022-04-28 03:14:07,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-28 03:14:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 03:14:07,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:07,231 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:07,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:07,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:07,432 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2114115751, now seen corresponding path program 20 times [2022-04-28 03:14:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:07,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972841006] [2022-04-28 03:14:07,676 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:07,879 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:07,880 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -258561077, now seen corresponding path program 1 times [2022-04-28 03:14:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:07,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020877139] [2022-04-28 03:14:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:07,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-28 03:14:07,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-28 03:14:07,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-28 03:14:07,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:07,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {9672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9663#true} is VALID [2022-04-28 03:14:07,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-28 03:14:07,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-28 03:14:07,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-28 03:14:07,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9668#(= main_~x~0 0)} is VALID [2022-04-28 03:14:07,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {9668#(= main_~x~0 0)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9669#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:07,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(<= main_~x~0 0)} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9669#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:07,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {9669#(<= main_~x~0 0)} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:07,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:07,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {9670#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9671#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:07,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(<= 48 main_~y~0)} assume ~y~0 < 0; {9664#false} is VALID [2022-04-28 03:14:07,928 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-28 03:14:07,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-28 03:14:07,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-28 03:14:07,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-28 03:14:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:07,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020877139] [2022-04-28 03:14:07,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020877139] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:07,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473931770] [2022-04-28 03:14:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:07,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:07,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:07,930 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:07,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:14:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:07,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:07,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:08,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9663#true} is VALID [2022-04-28 03:14:08,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#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(9, 2); {9663#true} is VALID [2022-04-28 03:14:08,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-28 03:14:08,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-28 03:14:08,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-28 03:14:08,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9669#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:08,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(<= main_~x~0 0)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9669#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:08,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(<= main_~x~0 0)} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9669#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:08,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {9669#(<= main_~x~0 0)} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:08,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:08,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {9700#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9671#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:08,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(<= 48 main_~y~0)} assume ~y~0 < 0; {9664#false} is VALID [2022-04-28 03:14:08,164 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-28 03:14:08,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-28 03:14:08,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-28 03:14:08,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-28 03:14:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:08,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:08,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#false} assume !false; {9664#false} is VALID [2022-04-28 03:14:08,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {9664#false} assume 0 == ~cond; {9664#false} is VALID [2022-04-28 03:14:08,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {9664#false} ~cond := #in~cond; {9664#false} is VALID [2022-04-28 03:14:08,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {9664#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {9664#false} is VALID [2022-04-28 03:14:08,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {9734#(not (< main_~y~0 0))} assume ~y~0 < 0; {9664#false} is VALID [2022-04-28 03:14:08,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {9734#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:08,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} [138] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:08,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [141] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_534 1))) (.cse1 (= v_main_~x~0_481 v_main_~x~0_480)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post3_265| |v_main_#t~post3_261|)) (.cse4 (= |v_main_#t~post1_136| |v_main_#t~post1_135|))) (or (and (= (+ v_main_~x~0_481 v_main_~y~0_533) (+ v_main_~x~0_480 v_main_~y~0_534)) .cse0 (< v_main_~x~0_480 51) (< v_main_~x~0_481 v_main_~x~0_480)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_481 50))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post3=|v_main_#t~post3_265|, main_~x~0=v_main_~x~0_481, main_#t~post1=|v_main_#t~post1_136|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post3=|v_main_#t~post3_261|, main_~x~0=v_main_~x~0_480, main_#t~post1=|v_main_#t~post1_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {9738#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:08,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [140] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:08,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {9752#(<= main_~x~0 48)} [139] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_479)) (.cse2 (= v_main_~y~0_532 v_main_~y~0_531)) (.cse3 (= v_main_~x~0_479 v_main_~x~0_478)) (.cse4 (= |v_main_#t~post2_147| |v_main_#t~post2_146|)) (.cse5 (= |v_main_#t~post3_262| |v_main_#t~post3_260|))) (or (let ((.cse0 (+ v_main_~x~0_479 v_main_~y~0_532))) (and (= (+ v_main_~x~0_478 v_main_~y~0_531) .cse0) .cse1 (< v_main_~x~0_479 v_main_~x~0_478) (<= v_main_~x~0_478 .cse0))) (and .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_532))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_532, main_#t~post2=|v_main_#t~post2_147|, main_#t~post3=|v_main_#t~post3_262|, main_~x~0=v_main_~x~0_479} OutVars{main_~y~0=v_main_~y~0_531, main_#t~post2=|v_main_#t~post2_146|, main_#t~post3=|v_main_#t~post3_260|, main_~x~0=v_main_~x~0_478} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {9745#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:08,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {9752#(<= main_~x~0 48)} is VALID [2022-04-28 03:14:08,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {9663#true} call #t~ret4 := main(); {9663#true} is VALID [2022-04-28 03:14:08,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9663#true} {9663#true} #61#return; {9663#true} is VALID [2022-04-28 03:14:08,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#true} assume true; {9663#true} is VALID [2022-04-28 03:14:08,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {9663#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(9, 2); {9663#true} is VALID [2022-04-28 03:14:08,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {9663#true} call ULTIMATE.init(); {9663#true} is VALID [2022-04-28 03:14:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:08,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473931770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:08,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:08,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-28 03:14:09,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:09,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972841006] [2022-04-28 03:14:09,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972841006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:09,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:09,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:14:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428528200] [2022-04-28 03:14:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:09,519 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 70 [2022-04-28 03:14:09,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:09,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 03:14:09,584 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 03:14:09,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:14:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:14:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1822, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:14:09,585 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 03:14:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:12,537 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 03:14:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:14:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 70 [2022-04-28 03:14:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 03:14:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 82 transitions. [2022-04-28 03:14:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 03:14:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 82 transitions. [2022-04-28 03:14:12,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 82 transitions. [2022-04-28 03:14:12,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:12,599 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:14:12,599 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 03:14:12,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=734, Invalid=6072, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:14:12,600 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:12,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:14:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 03:14:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 03:14:12,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:12,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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 03:14:12,793 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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 03:14:12,793 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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 03:14:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:12,794 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-28 03:14:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-28 03:14:12,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:12,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:12,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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) Second operand 81 states. [2022-04-28 03:14:12,795 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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) Second operand 81 states. [2022-04-28 03:14:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:12,796 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-28 03:14:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-28 03:14:12,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:12,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:12,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:12,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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 03:14:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-28 03:14:12,797 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 70 [2022-04-28 03:14:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:12,797 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-28 03:14:12,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 40 states have internal predecessors, (66), 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 03:14:12,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-28 03:14:12,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-28 03:14:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 03:14:12,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:12,867 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:12,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:13,068 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1486755709, now seen corresponding path program 21 times [2022-04-28 03:14:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:13,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620494947] [2022-04-28 03:14:13,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:13,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:13,450 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2048144181, now seen corresponding path program 1 times [2022-04-28 03:14:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:13,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648882678] [2022-04-28 03:14:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-28 03:14:13,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-28 03:14:13,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-28 03:14:13,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:13,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {10403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10394#true} is VALID [2022-04-28 03:14:13,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-28 03:14:13,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-28 03:14:13,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-28 03:14:13,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10399#(= main_~x~0 0)} is VALID [2022-04-28 03:14:13,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {10399#(= main_~x~0 0)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10400#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:13,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(<= main_~x~0 0)} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10400#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:13,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#(<= main_~x~0 0)} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:13,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:13,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {10401#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10402#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:13,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {10402#(<= 48 main_~y~0)} assume ~y~0 < 0; {10395#false} is VALID [2022-04-28 03:14:13,502 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-28 03:14:13,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-28 03:14:13,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-28 03:14:13,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-28 03:14:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:13,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648882678] [2022-04-28 03:14:13,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648882678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:13,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862161157] [2022-04-28 03:14:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:13,503 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:14:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:13,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-28 03:14:13,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#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(9, 2); {10394#true} is VALID [2022-04-28 03:14:13,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-28 03:14:13,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-28 03:14:13,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-28 03:14:13,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10400#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:13,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {10400#(<= main_~x~0 0)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10400#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:13,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(<= main_~x~0 0)} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10400#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:13,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#(<= main_~x~0 0)} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:13,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:13,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {10431#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10402#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:13,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {10402#(<= 48 main_~y~0)} assume ~y~0 < 0; {10395#false} is VALID [2022-04-28 03:14:13,709 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-28 03:14:13,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-28 03:14:13,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-28 03:14:13,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-28 03:14:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:13,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:14,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-28 03:14:14,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {10395#false} assume 0 == ~cond; {10395#false} is VALID [2022-04-28 03:14:14,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {10395#false} ~cond := #in~cond; {10395#false} is VALID [2022-04-28 03:14:14,138 INFO L272 TraceCheckUtils]: 12: Hoare triple {10395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {10395#false} is VALID [2022-04-28 03:14:14,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {10465#(not (< main_~y~0 0))} assume ~y~0 < 0; {10395#false} is VALID [2022-04-28 03:14:14,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {10465#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:14,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} [142] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:14,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [145] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_572 1))) (.cse1 (= |v_main_#t~post3_279| |v_main_#t~post3_275|)) (.cse2 (= v_main_~y~0_572 v_main_~y~0_571)) (.cse3 (= v_main_~x~0_516 v_main_~x~0_515)) (.cse4 (= |v_main_#t~post1_143| |v_main_#t~post1_142|))) (or (and (< v_main_~x~0_516 v_main_~x~0_515) (< v_main_~x~0_515 51) (= (+ v_main_~x~0_516 v_main_~y~0_571) (+ v_main_~x~0_515 v_main_~y~0_572)) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_516 50)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_572, main_#t~post3=|v_main_#t~post3_279|, main_~x~0=v_main_~x~0_516, main_#t~post1=|v_main_#t~post1_143|} OutVars{main_~y~0=v_main_~y~0_571, main_#t~post3=|v_main_#t~post3_275|, main_~x~0=v_main_~x~0_515, main_#t~post1=|v_main_#t~post1_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {10469#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:14,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [144] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:14,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {10483#(<= main_~x~0 48)} [143] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_514)) (.cse2 (= v_main_~x~0_514 v_main_~x~0_513)) (.cse3 (= |v_main_#t~post2_155| |v_main_#t~post2_154|)) (.cse4 (= |v_main_#t~post3_276| |v_main_#t~post3_274|))) (or (let ((.cse1 (+ v_main_~x~0_514 v_main_~y~0_570))) (and .cse0 (< v_main_~x~0_514 v_main_~x~0_513) (= (+ v_main_~x~0_513 v_main_~y~0_569) .cse1) (<= v_main_~x~0_513 .cse1))) (and (= v_main_~y~0_569 v_main_~y~0_570) (or (not .cse0) (not (<= 1 v_main_~y~0_570))) .cse2 .cse3 .cse4) (and (= v_main_~y~0_570 v_main_~y~0_569) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_570, main_#t~post2=|v_main_#t~post2_155|, main_#t~post3=|v_main_#t~post3_276|, main_~x~0=v_main_~x~0_514} OutVars{main_~y~0=v_main_~y~0_569, main_#t~post2=|v_main_#t~post2_154|, main_#t~post3=|v_main_#t~post3_274|, main_~x~0=v_main_~x~0_513} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {10476#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:14,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {10394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {10483#(<= main_~x~0 48)} is VALID [2022-04-28 03:14:14,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {10394#true} call #t~ret4 := main(); {10394#true} is VALID [2022-04-28 03:14:14,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10394#true} #61#return; {10394#true} is VALID [2022-04-28 03:14:14,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-28 03:14:14,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#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(9, 2); {10394#true} is VALID [2022-04-28 03:14:14,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-28 03:14:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:14,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862161157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:14,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:14,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-28 03:14:14,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620494947] [2022-04-28 03:14:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620494947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:14,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:14,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:14:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344055031] [2022-04-28 03:14:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 73 [2022-04-28 03:14:14,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:14,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 03:14:15,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:15,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:14:15,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:14:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:14:15,030 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 03:14:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,435 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-04-28 03:14:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:14:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 73 [2022-04-28 03:14:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 03:14:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 85 transitions. [2022-04-28 03:14:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 03:14:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 85 transitions. [2022-04-28 03:14:18,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 85 transitions. [2022-04-28 03:14:18,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:18,507 INFO L225 Difference]: With dead ends: 99 [2022-04-28 03:14:18,508 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 03:14:18,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=773, Invalid=6709, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 03:14:18,508 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:18,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 94 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:14:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 03:14:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-28 03:14:18,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:18,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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 03:14:18,713 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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 03:14:18,713 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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 03:14:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,714 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 03:14:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 03:14:18,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:18,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:18,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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) Second operand 84 states. [2022-04-28 03:14:18,714 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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) Second operand 84 states. [2022-04-28 03:14:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,715 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 03:14:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 03:14:18,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:18,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:18,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:18,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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 03:14:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-04-28 03:14:18,716 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 73 [2022-04-28 03:14:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:18,716 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-04-28 03:14:18,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 42 states have internal predecessors, (69), 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 03:14:18,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 87 transitions. [2022-04-28 03:14:18,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-28 03:14:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 03:14:18,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:18,812 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:18,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:19,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 03:14:19,013 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 349731623, now seen corresponding path program 22 times [2022-04-28 03:14:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:19,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106318971] [2022-04-28 03:14:23,154 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:23,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:23,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:23,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 457240011, now seen corresponding path program 1 times [2022-04-28 03:14:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:23,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627280325] [2022-04-28 03:14:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-28 03:14:23,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-28 03:14:23,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-28 03:14:23,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:23,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11149#true} is VALID [2022-04-28 03:14:23,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-28 03:14:23,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-28 03:14:23,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-28 03:14:23,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:23,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {11154#(and (= main_~x~0 0) (= main_~y~0 0))} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:23,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:23,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {11155#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:23,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:23,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {11156#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11157#(<= 49 main_~y~0)} is VALID [2022-04-28 03:14:23,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {11157#(<= 49 main_~y~0)} assume ~y~0 < 0; {11150#false} is VALID [2022-04-28 03:14:23,561 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-28 03:14:23,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-28 03:14:23,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-28 03:14:23,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-28 03:14:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627280325] [2022-04-28 03:14:23,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627280325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777114533] [2022-04-28 03:14:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:23,563 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:23,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:14:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:23,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11149#true} is VALID [2022-04-28 03:14:23,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#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(9, 2); {11149#true} is VALID [2022-04-28 03:14:23,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-28 03:14:23,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-28 03:14:23,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-28 03:14:23,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11177#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:23,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {11177#(<= main_~x~0 0)} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11177#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:23,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {11177#(<= main_~x~0 0)} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11177#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:23,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {11177#(<= main_~x~0 0)} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:23,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:23,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {11187#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11194#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:23,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {11194#(<= 48 main_~y~0)} assume ~y~0 < 0; {11150#false} is VALID [2022-04-28 03:14:23,795 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-28 03:14:23,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-28 03:14:23,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-28 03:14:23,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-28 03:14:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:23,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:24,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#false} assume !false; {11150#false} is VALID [2022-04-28 03:14:24,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {11150#false} assume 0 == ~cond; {11150#false} is VALID [2022-04-28 03:14:24,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {11150#false} ~cond := #in~cond; {11150#false} is VALID [2022-04-28 03:14:24,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {11150#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11150#false} is VALID [2022-04-28 03:14:24,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {11222#(not (< main_~y~0 0))} assume ~y~0 < 0; {11150#false} is VALID [2022-04-28 03:14:24,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11222#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:24,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} [146] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:24,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [149] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post1_150| |v_main_#t~post1_149|)) (.cse2 (= |v_main_#t~post3_293| |v_main_#t~post3_289|)) (.cse3 (= v_main_~x~0_552 v_main_~x~0_551)) (.cse0 (<= 0 (+ v_main_~y~0_611 1))) (.cse4 (= v_main_~y~0_611 v_main_~y~0_610))) (or (and (< v_main_~x~0_552 v_main_~x~0_551) .cse0 (= (+ v_main_~x~0_552 v_main_~y~0_610) (+ v_main_~x~0_551 v_main_~y~0_611)) (< v_main_~x~0_551 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_552 50)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_611, main_#t~post3=|v_main_#t~post3_293|, main_~x~0=v_main_~x~0_552, main_#t~post1=|v_main_#t~post1_150|} OutVars{main_~y~0=v_main_~y~0_610, main_#t~post3=|v_main_#t~post3_289|, main_~x~0=v_main_~x~0_551, main_#t~post1=|v_main_#t~post1_149|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11226#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:24,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [148] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:24,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#(<= main_~x~0 48)} [147] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_550)) (.cse1 (= v_main_~y~0_609 v_main_~y~0_608)) (.cse2 (= |v_main_#t~post3_290| |v_main_#t~post3_288|)) (.cse3 (= |v_main_#t~post2_163| |v_main_#t~post2_162|))) (or (and (< v_main_~y~0_608 v_main_~y~0_609) (<= 0 v_main_~y~0_608) (= (+ v_main_~x~0_549 v_main_~y~0_608) (+ v_main_~x~0_550 v_main_~y~0_609)) .cse0) (and (or (not .cse0) (not (<= 1 v_main_~y~0_609))) .cse1 .cse2 .cse3 (= v_main_~x~0_549 v_main_~x~0_550)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_550 v_main_~x~0_549)))) InVars {main_~y~0=v_main_~y~0_609, main_#t~post2=|v_main_#t~post2_163|, main_#t~post3=|v_main_#t~post3_290|, main_~x~0=v_main_~x~0_550} OutVars{main_~y~0=v_main_~y~0_608, main_#t~post2=|v_main_#t~post2_162|, main_#t~post3=|v_main_#t~post3_288|, main_~x~0=v_main_~x~0_549} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11233#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:24,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {11149#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11240#(<= main_~x~0 48)} is VALID [2022-04-28 03:14:24,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {11149#true} call #t~ret4 := main(); {11149#true} is VALID [2022-04-28 03:14:24,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11149#true} {11149#true} #61#return; {11149#true} is VALID [2022-04-28 03:14:24,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {11149#true} assume true; {11149#true} is VALID [2022-04-28 03:14:24,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {11149#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(9, 2); {11149#true} is VALID [2022-04-28 03:14:24,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {11149#true} call ULTIMATE.init(); {11149#true} is VALID [2022-04-28 03:14:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:24,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777114533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:24,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:24,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:14:25,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106318971] [2022-04-28 03:14:25,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106318971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:25,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:25,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:14:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201244498] [2022-04-28 03:14:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 76 [2022-04-28 03:14:25,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:25,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 03:14:25,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:25,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:14:25,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:14:25,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2482, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:14:25,461 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 03:14:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:29,688 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-28 03:14:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:14:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 76 [2022-04-28 03:14:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 03:14:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 88 transitions. [2022-04-28 03:14:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 03:14:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 88 transitions. [2022-04-28 03:14:29,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 88 transitions. [2022-04-28 03:14:29,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:29,754 INFO L225 Difference]: With dead ends: 102 [2022-04-28 03:14:29,755 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 03:14:29,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=841, Invalid=8279, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:14:29,756 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:29,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:14:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 03:14:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-04-28 03:14:29,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:29,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 03:14:29,971 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 03:14:29,971 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 03:14:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:29,972 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-28 03:14:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-28 03:14:29,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:29,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:29,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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) Second operand 87 states. [2022-04-28 03:14:29,972 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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) Second operand 87 states. [2022-04-28 03:14:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:29,973 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-28 03:14:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-28 03:14:29,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:29,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:29,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:29,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 03:14:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-28 03:14:29,975 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 76 [2022-04-28 03:14:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:29,975 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-28 03:14:29,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 45 states have internal predecessors, (72), 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 03:14:29,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-28 03:14:30,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 03:14:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 03:14:30,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:30,071 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:30,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:30,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 03:14:30,271 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1850422787, now seen corresponding path program 23 times [2022-04-28 03:14:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731477486] [2022-04-28 03:14:30,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:30,692 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:30,693 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1332343093, now seen corresponding path program 1 times [2022-04-28 03:14:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859059890] [2022-04-28 03:14:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:30,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {11943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-28 03:14:30,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-28 03:14:30,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:30,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:30,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11940#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:30,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {11940#(and (= main_~x~0 0) (= main_~y~0 0))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:30,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:30,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#(or (<= main_~x~0 0) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11942#(<= 0 main_~y~0)} is VALID [2022-04-28 03:14:30,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {11942#(<= 0 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-28 03:14:30,748 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-28 03:14:30,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-28 03:14:30,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-28 03:14:30,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-28 03:14:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:30,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859059890] [2022-04-28 03:14:30,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859059890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:30,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128108868] [2022-04-28 03:14:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:30,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:30,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:30,768 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:30,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:14:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:14:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:31,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11935#true} is VALID [2022-04-28 03:14:31,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#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(9, 2); {11935#true} is VALID [2022-04-28 03:14:31,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-28 03:14:31,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-28 03:14:31,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-28 03:14:31,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:31,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:31,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:31,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {11962#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:14:31,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:14:31,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {11972#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11979#(<= 49 main_~y~0)} is VALID [2022-04-28 03:14:31,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {11979#(<= 49 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-28 03:14:31,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-28 03:14:31,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-28 03:14:31,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-28 03:14:31,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-28 03:14:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:31,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:31,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {11936#false} assume !false; {11936#false} is VALID [2022-04-28 03:14:31,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {11936#false} assume 0 == ~cond; {11936#false} is VALID [2022-04-28 03:14:31,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {11936#false} ~cond := #in~cond; {11936#false} is VALID [2022-04-28 03:14:31,442 INFO L272 TraceCheckUtils]: 12: Hoare triple {11936#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {11936#false} is VALID [2022-04-28 03:14:31,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {11942#(<= 0 main_~y~0)} assume ~y~0 < 0; {11936#false} is VALID [2022-04-28 03:14:31,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {11942#(<= 0 main_~y~0)} is VALID [2022-04-28 03:14:31,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} [150] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:31,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [153] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_651 v_main_~y~0_650)) (.cse0 (<= 0 (+ v_main_~y~0_651 1))) (.cse3 (= |v_main_#t~post3_307| |v_main_#t~post3_303|)) (.cse4 (= |v_main_#t~post1_157| |v_main_#t~post1_156|))) (or (let ((.cse1 (+ v_main_~x~0_589 v_main_~y~0_650))) (and .cse0 (< .cse1 (+ 51 v_main_~y~0_651)) (= .cse1 (+ v_main_~x~0_588 v_main_~y~0_651)) (< v_main_~y~0_651 v_main_~y~0_650))) (and .cse2 .cse3 .cse4 (= v_main_~x~0_589 v_main_~x~0_588)) (and .cse2 (or (not (< v_main_~x~0_589 50)) (not .cse0)) .cse3 .cse4 (= v_main_~x~0_588 v_main_~x~0_589)))) InVars {main_~y~0=v_main_~y~0_651, main_#t~post3=|v_main_#t~post3_307|, main_~x~0=v_main_~x~0_589, main_#t~post1=|v_main_#t~post1_157|} OutVars{main_~y~0=v_main_~y~0_650, main_#t~post3=|v_main_#t~post3_303|, main_~x~0=v_main_~x~0_588, main_#t~post1=|v_main_#t~post1_156|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12010#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:31,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [152] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:31,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {12024#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [151] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_171| |v_main_#t~post2_170|)) (.cse1 (= v_main_~x~0_587 v_main_~x~0_586)) (.cse4 (<= 50 v_main_~x~0_587)) (.cse2 (= v_main_~y~0_649 v_main_~y~0_648)) (.cse3 (= |v_main_#t~post3_304| |v_main_#t~post3_302|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_586 v_main_~y~0_648) (+ v_main_~x~0_587 v_main_~y~0_649)) (<= 0 v_main_~y~0_648) (< v_main_~y~0_648 v_main_~y~0_649) .cse4) (and .cse0 .cse1 (or (not (<= 1 v_main_~y~0_649)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_649, main_#t~post2=|v_main_#t~post2_171|, main_#t~post3=|v_main_#t~post3_304|, main_~x~0=v_main_~x~0_587} OutVars{main_~y~0=v_main_~y~0_648, main_#t~post2=|v_main_#t~post2_170|, main_#t~post3=|v_main_#t~post3_302|, main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12017#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:31,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {11935#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12024#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:14:31,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {11935#true} call #t~ret4 := main(); {11935#true} is VALID [2022-04-28 03:14:31,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11935#true} {11935#true} #61#return; {11935#true} is VALID [2022-04-28 03:14:31,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {11935#true} assume true; {11935#true} is VALID [2022-04-28 03:14:31,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#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(9, 2); {11935#true} is VALID [2022-04-28 03:14:31,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {11935#true} call ULTIMATE.init(); {11935#true} is VALID [2022-04-28 03:14:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:31,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128108868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:31,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:31,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:14:32,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:32,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731477486] [2022-04-28 03:14:32,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731477486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:32,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:32,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:14:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152851689] [2022-04-28 03:14:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 79 [2022-04-28 03:14:32,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:32,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 03:14:32,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:14:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:14:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2478, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:14:32,586 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 03:14:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:36,868 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-04-28 03:14:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:14:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 79 [2022-04-28 03:14:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 03:14:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-28 03:14:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 03:14:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-28 03:14:36,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 91 transitions. [2022-04-28 03:14:36,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:36,937 INFO L225 Difference]: With dead ends: 104 [2022-04-28 03:14:36,937 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:14:36,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=914, Invalid=8788, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 03:14:36,938 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:36,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 185 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:14:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:14:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-28 03:14:37,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:37,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 03:14:37,167 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 03:14:37,167 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 03:14:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:37,169 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:14:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:14:37,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:37,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:37,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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) Second operand 89 states. [2022-04-28 03:14:37,169 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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) Second operand 89 states. [2022-04-28 03:14:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:37,170 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:14:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:14:37,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:37,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:37,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:37,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 03:14:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-04-28 03:14:37,172 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 79 [2022-04-28 03:14:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:37,172 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-04-28 03:14:37,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 47 states have internal predecessors, (75), 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 03:14:37,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2022-04-28 03:14:37,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:14:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 03:14:37,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:37,272 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:37,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:37,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 03:14:37,473 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1668661849, now seen corresponding path program 24 times [2022-04-28 03:14:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:37,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410562783] [2022-04-28 03:14:37,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:41,753 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:41,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:41,846 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1173041099, now seen corresponding path program 1 times [2022-04-28 03:14:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424219031] [2022-04-28 03:14:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:41,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:41,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {12749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-28 03:14:41,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12746#(= main_~x~0 0)} is VALID [2022-04-28 03:14:41,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {12746#(= main_~x~0 0)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12746#(= main_~x~0 0)} is VALID [2022-04-28 03:14:41,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {12746#(= main_~x~0 0)} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12746#(= main_~x~0 0)} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {12746#(= main_~x~0 0)} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {12747#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12748#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {12748#(<= 48 main_~y~0)} assume ~y~0 < 0; {12742#false} is VALID [2022-04-28 03:14:41,890 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-28 03:14:41,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-28 03:14:41,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-28 03:14:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:41,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424219031] [2022-04-28 03:14:41,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424219031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:41,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304884396] [2022-04-28 03:14:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:41,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:41,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:41,892 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:41,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:14:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:41,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:41,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:42,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12741#true} is VALID [2022-04-28 03:14:42,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#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(9, 2); {12741#true} is VALID [2022-04-28 03:14:42,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-28 03:14:42,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-28 03:14:42,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-28 03:14:42,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12768#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:42,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {12768#(<= main_~x~0 0)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12768#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:42,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {12768#(<= main_~x~0 0)} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12768#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:42,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {12768#(<= main_~x~0 0)} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:42,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:42,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {12778#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12748#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:42,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {12748#(<= 48 main_~y~0)} assume ~y~0 < 0; {12742#false} is VALID [2022-04-28 03:14:42,028 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-28 03:14:42,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-28 03:14:42,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-28 03:14:42,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-28 03:14:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:42,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:42,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {12742#false} assume !false; {12742#false} is VALID [2022-04-28 03:14:42,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {12742#false} assume 0 == ~cond; {12742#false} is VALID [2022-04-28 03:14:42,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {12742#false} ~cond := #in~cond; {12742#false} is VALID [2022-04-28 03:14:42,269 INFO L272 TraceCheckUtils]: 12: Hoare triple {12742#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {12742#false} is VALID [2022-04-28 03:14:42,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {12812#(not (< main_~y~0 0))} assume ~y~0 < 0; {12742#false} is VALID [2022-04-28 03:14:42,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {12812#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:42,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} [154] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:42,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [157] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_692 1))) (.cse1 (= |v_main_#t~post1_164| |v_main_#t~post1_163|)) (.cse2 (= v_main_~x~0_627 v_main_~x~0_626)) (.cse3 (= v_main_~y~0_692 v_main_~y~0_691))) (or (and (< v_main_~x~0_626 51) .cse0 (< v_main_~x~0_627 v_main_~x~0_626) (= (+ v_main_~x~0_627 v_main_~y~0_691) (+ v_main_~x~0_626 v_main_~y~0_692))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_627 50))) .cse2 (= |v_main_#t~post3_317| |v_main_#t~post3_321|) .cse3) (and (= |v_main_#t~post3_321| |v_main_#t~post3_317|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_692, main_#t~post3=|v_main_#t~post3_321|, main_~x~0=v_main_~x~0_627, main_#t~post1=|v_main_#t~post1_164|} OutVars{main_~y~0=v_main_~y~0_691, main_#t~post3=|v_main_#t~post3_317|, main_~x~0=v_main_~x~0_626, main_#t~post1=|v_main_#t~post1_163|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {12816#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:42,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [156] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:42,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {12830#(<= main_~x~0 48)} [155] L28-2-->L29_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse2 (= |v_main_#t~post2_179| |v_main_#t~post2_178|)) (.cse3 (= v_main_~x~0_625 v_main_~x~0_624)) (.cse0 (<= 50 v_main_~x~0_625))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_690))) .cse1 (= v_main_~y~0_689 v_main_~y~0_690) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689) .cse3) (let ((.cse4 (+ v_main_~x~0_625 v_main_~y~0_690))) (and (< v_main_~x~0_625 v_main_~x~0_624) .cse0 (<= v_main_~x~0_624 .cse4) (= .cse4 (+ v_main_~x~0_624 v_main_~y~0_689)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post2=|v_main_#t~post2_179|, main_#t~post3=|v_main_#t~post3_318|, main_~x~0=v_main_~x~0_625} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post2=|v_main_#t~post2_178|, main_#t~post3=|v_main_#t~post3_316|, main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {12823#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:42,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {12741#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {12830#(<= main_~x~0 48)} is VALID [2022-04-28 03:14:42,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {12741#true} call #t~ret4 := main(); {12741#true} is VALID [2022-04-28 03:14:42,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12741#true} {12741#true} #61#return; {12741#true} is VALID [2022-04-28 03:14:42,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {12741#true} assume true; {12741#true} is VALID [2022-04-28 03:14:42,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {12741#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(9, 2); {12741#true} is VALID [2022-04-28 03:14:42,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {12741#true} call ULTIMATE.init(); {12741#true} is VALID [2022-04-28 03:14:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:42,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304884396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:42,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:42,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:14:43,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:43,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410562783] [2022-04-28 03:14:43,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410562783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:43,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:43,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:14:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268893414] [2022-04-28 03:14:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 82 [2022-04-28 03:14:43,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:43,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 03:14:43,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:43,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:14:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:43,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:14:43,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:14:43,249 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 03:14:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:46,130 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-04-28 03:14:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:14:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 82 [2022-04-28 03:14:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 03:14:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-28 03:14:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 03:14:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-04-28 03:14:46,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 94 transitions. [2022-04-28 03:14:46,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:46,205 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:14:46,205 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 03:14:46,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=890, Invalid=8812, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 03:14:46,206 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:46,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 132 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:14:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 03:14:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-28 03:14:46,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:46,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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 03:14:46,448 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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 03:14:46,448 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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 03:14:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:46,449 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 03:14:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 03:14:46,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:46,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:46,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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) Second operand 93 states. [2022-04-28 03:14:46,450 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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) Second operand 93 states. [2022-04-28 03:14:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:46,451 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 03:14:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 03:14:46,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:46,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:46,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:46,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 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 03:14:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-28 03:14:46,453 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 82 [2022-04-28 03:14:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:46,453 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-28 03:14:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 48 states have internal predecessors, (78), 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 03:14:46,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-28 03:14:46,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-28 03:14:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 03:14:46,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:46,557 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:46,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:46,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:46,771 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1432642435, now seen corresponding path program 25 times [2022-04-28 03:14:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:46,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99024075] [2022-04-28 03:14:46,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:51,109 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:14:51,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:51,227 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash -616542005, now seen corresponding path program 1 times [2022-04-28 03:14:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:51,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175614602] [2022-04-28 03:14:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:51,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:51,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-28 03:14:51,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-28 03:14:51,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13573#(= main_~x~0 0)} is VALID [2022-04-28 03:14:51,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {13573#(= main_~x~0 0)} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13573#(= main_~x~0 0)} is VALID [2022-04-28 03:14:51,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {13573#(= main_~x~0 0)} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13573#(= main_~x~0 0)} is VALID [2022-04-28 03:14:51,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {13573#(= main_~x~0 0)} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:51,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:14:51,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {13574#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13575#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-28 03:14:51,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {13575#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {13569#false} is VALID [2022-04-28 03:14:51,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-28 03:14:51,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-28 03:14:51,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-28 03:14:51,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-28 03:14:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:51,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175614602] [2022-04-28 03:14:51,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175614602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:51,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910151300] [2022-04-28 03:14:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:51,289 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:14:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:51,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:14:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:51,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:51,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13568#true} is VALID [2022-04-28 03:14:51,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#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(9, 2); {13568#true} is VALID [2022-04-28 03:14:51,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-28 03:14:51,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-28 03:14:51,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-28 03:14:51,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:51,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:51,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:14:51,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {13595#(and (<= main_~x~0 0) (= main_~y~0 0))} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:14:51,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:14:51,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {13605#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13612#(<= 49 main_~y~0)} is VALID [2022-04-28 03:14:51,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {13612#(<= 49 main_~y~0)} assume ~y~0 < 0; {13569#false} is VALID [2022-04-28 03:14:51,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-28 03:14:51,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-28 03:14:51,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-28 03:14:51,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-28 03:14:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:51,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:51,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {13569#false} assume !false; {13569#false} is VALID [2022-04-28 03:14:51,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {13569#false} assume 0 == ~cond; {13569#false} is VALID [2022-04-28 03:14:51,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {13569#false} ~cond := #in~cond; {13569#false} is VALID [2022-04-28 03:14:51,988 INFO L272 TraceCheckUtils]: 12: Hoare triple {13569#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {13569#false} is VALID [2022-04-28 03:14:51,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {13640#(not (< main_~y~0 0))} assume ~y~0 < 0; {13569#false} is VALID [2022-04-28 03:14:51,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {13640#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:51,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} [158] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:51,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [161] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_734 v_main_~y~0_733)) (.cse1 (= |v_main_#t~post3_335| |v_main_#t~post3_331|)) (.cse2 (= |v_main_#t~post1_171| |v_main_#t~post1_170|)) (.cse3 (<= 0 (+ v_main_~y~0_734 1)))) (or (and (= v_main_~x~0_666 v_main_~x~0_665) .cse0 .cse1 .cse2) (and (or (not .cse3) (not (< v_main_~x~0_666 50))) .cse0 .cse1 (= v_main_~x~0_665 v_main_~x~0_666) .cse2) (let ((.cse4 (+ v_main_~x~0_666 v_main_~y~0_733))) (and .cse3 (= (+ v_main_~x~0_665 v_main_~y~0_734) .cse4) (< v_main_~y~0_734 v_main_~y~0_733) (< .cse4 (+ 51 v_main_~y~0_734)))))) InVars {main_~y~0=v_main_~y~0_734, main_#t~post3=|v_main_#t~post3_335|, main_~x~0=v_main_~x~0_666, main_#t~post1=|v_main_#t~post1_171|} OutVars{main_~y~0=v_main_~y~0_733, main_#t~post3=|v_main_#t~post3_331|, main_~x~0=v_main_~x~0_665, main_#t~post1=|v_main_#t~post1_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {13644#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:51,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [160] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:51,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {13658#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [159] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_664)) (.cse0 (= |v_main_#t~post3_332| |v_main_#t~post3_330|)) (.cse1 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse2 (= |v_main_#t~post2_187| |v_main_#t~post2_186|)) (.cse4 (= v_main_~y~0_732 v_main_~y~0_731))) (or (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_732)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_664 v_main_~y~0_732))) (and (= (+ v_main_~x~0_663 v_main_~y~0_731) .cse5) .cse3 (<= v_main_~x~0_663 .cse5) (< v_main_~x~0_664 v_main_~x~0_663))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_732, main_#t~post2=|v_main_#t~post2_187|, main_#t~post3=|v_main_#t~post3_332|, main_~x~0=v_main_~x~0_664} OutVars{main_~y~0=v_main_~y~0_731, main_#t~post2=|v_main_#t~post2_186|, main_#t~post3=|v_main_#t~post3_330|, main_~x~0=v_main_~x~0_663} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {13651#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:51,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {13568#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {13658#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:14:51,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {13568#true} call #t~ret4 := main(); {13568#true} is VALID [2022-04-28 03:14:51,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13568#true} {13568#true} #61#return; {13568#true} is VALID [2022-04-28 03:14:51,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {13568#true} assume true; {13568#true} is VALID [2022-04-28 03:14:51,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {13568#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(9, 2); {13568#true} is VALID [2022-04-28 03:14:51,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {13568#true} call ULTIMATE.init(); {13568#true} is VALID [2022-04-28 03:14:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:51,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910151300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:51,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:51,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:14:53,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99024075] [2022-04-28 03:14:53,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99024075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:53,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:53,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:14:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588527922] [2022-04-28 03:14:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 85 [2022-04-28 03:14:53,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:53,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 03:14:53,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:14:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:14:53,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2899, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:14:53,196 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 03:14:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:56,883 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-28 03:14:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:14:56,884 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 85 [2022-04-28 03:14:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 03:14:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2022-04-28 03:14:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 03:14:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2022-04-28 03:14:56,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 97 transitions. [2022-04-28 03:14:56,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:56,960 INFO L225 Difference]: With dead ends: 111 [2022-04-28 03:14:56,960 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 03:14:56,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=886, Invalid=9826, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:14:56,961 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:56,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:14:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 03:14:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-28 03:14:57,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:57,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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 03:14:57,216 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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 03:14:57,216 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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 03:14:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:57,217 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:14:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:14:57,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:57,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:57,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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) Second operand 96 states. [2022-04-28 03:14:57,218 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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) Second operand 96 states. [2022-04-28 03:14:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:57,219 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:14:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:14:57,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:57,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:57,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:57,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 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 03:14:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2022-04-28 03:14:57,220 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 85 [2022-04-28 03:14:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:57,220 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2022-04-28 03:14:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 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 03:14:57,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 99 transitions. [2022-04-28 03:14:57,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2022-04-28 03:14:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 03:14:57,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:57,329 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:57,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:57,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:14:57,529 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash -947904473, now seen corresponding path program 26 times [2022-04-28 03:14:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:57,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393300111] [2022-04-28 03:14:57,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:57,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:14:57,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:14:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1888842187, now seen corresponding path program 1 times [2022-04-28 03:14:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:57,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483615186] [2022-04-28 03:14:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-28 03:14:58,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-28 03:14:58,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-28 03:14:58,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:14:58,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {14428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14420#true} is VALID [2022-04-28 03:14:58,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-28 03:14:58,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-28 03:14:58,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-28 03:14:58,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14425#(= main_~x~0 0)} is VALID [2022-04-28 03:14:58,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {14425#(= main_~x~0 0)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14425#(= main_~x~0 0)} is VALID [2022-04-28 03:14:58,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {14425#(= main_~x~0 0)} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14425#(= main_~x~0 0)} is VALID [2022-04-28 03:14:58,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {14425#(= main_~x~0 0)} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {14426#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14427#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {14427#(<= 48 main_~y~0)} assume ~y~0 < 0; {14421#false} is VALID [2022-04-28 03:14:58,036 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-28 03:14:58,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-28 03:14:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483615186] [2022-04-28 03:14:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483615186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311698066] [2022-04-28 03:14:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:58,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:58,038 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:14:58,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:14:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:58,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14420#true} is VALID [2022-04-28 03:14:58,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#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(9, 2); {14420#true} is VALID [2022-04-28 03:14:58,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-28 03:14:58,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-28 03:14:58,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-28 03:14:58,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14447#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:58,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {14447#(<= main_~x~0 0)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14447#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:58,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {14447#(<= main_~x~0 0)} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14447#(<= main_~x~0 0)} is VALID [2022-04-28 03:14:58,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {14447#(<= main_~x~0 0)} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:58,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:14:58,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {14457#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14427#(<= 48 main_~y~0)} is VALID [2022-04-28 03:14:58,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {14427#(<= 48 main_~y~0)} assume ~y~0 < 0; {14421#false} is VALID [2022-04-28 03:14:58,178 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-28 03:14:58,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-28 03:14:58,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-28 03:14:58,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-28 03:14:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:14:58,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:58,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {14421#false} assume !false; {14421#false} is VALID [2022-04-28 03:14:58,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {14421#false} assume 0 == ~cond; {14421#false} is VALID [2022-04-28 03:14:58,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {14421#false} ~cond := #in~cond; {14421#false} is VALID [2022-04-28 03:14:58,403 INFO L272 TraceCheckUtils]: 12: Hoare triple {14421#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {14421#false} is VALID [2022-04-28 03:14:58,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {14491#(not (< main_~y~0 0))} assume ~y~0 < 0; {14421#false} is VALID [2022-04-28 03:14:58,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {14491#(not (< main_~y~0 0))} is VALID [2022-04-28 03:14:58,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} [162] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:58,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [165] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_777 1))) (.cse1 (= v_main_~x~0_706 v_main_~x~0_705)) (.cse2 (= |v_main_#t~post1_178| |v_main_#t~post1_177|)) (.cse3 (= |v_main_#t~post3_349| |v_main_#t~post3_345|)) (.cse4 (= v_main_~y~0_777 v_main_~y~0_776))) (or (and (< v_main_~x~0_706 v_main_~x~0_705) .cse0 (= (+ v_main_~x~0_706 v_main_~y~0_776) (+ v_main_~x~0_705 v_main_~y~0_777)) (< v_main_~x~0_705 51)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_706 50))) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_777, main_#t~post3=|v_main_#t~post3_349|, main_~x~0=v_main_~x~0_706, main_#t~post1=|v_main_#t~post1_178|} OutVars{main_~y~0=v_main_~y~0_776, main_#t~post3=|v_main_#t~post3_345|, main_~x~0=v_main_~x~0_705, main_#t~post1=|v_main_#t~post1_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {14495#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:14:58,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [164] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:58,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {14509#(<= main_~x~0 48)} [163] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_704 v_main_~x~0_703)) (.cse2 (= v_main_~y~0_775 v_main_~y~0_774)) (.cse3 (= |v_main_#t~post3_346| |v_main_#t~post3_344|)) (.cse1 (<= 50 v_main_~x~0_704))) (or (and .cse0 (or (not (<= 1 v_main_~y~0_775)) (not .cse1)) .cse2 (= |v_main_#t~post2_194| |v_main_#t~post2_195|) .cse3) (and .cse0 (= |v_main_#t~post2_195| |v_main_#t~post2_194|) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_704 v_main_~y~0_775))) (and (< v_main_~x~0_704 v_main_~x~0_703) (<= v_main_~x~0_703 .cse4) .cse1 (= .cse4 (+ v_main_~x~0_703 v_main_~y~0_774)))))) InVars {main_~y~0=v_main_~y~0_775, main_#t~post2=|v_main_#t~post2_195|, main_#t~post3=|v_main_#t~post3_346|, main_~x~0=v_main_~x~0_704} OutVars{main_~y~0=v_main_~y~0_774, main_#t~post2=|v_main_#t~post2_194|, main_#t~post3=|v_main_#t~post3_344|, main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {14502#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:14:58,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {14420#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {14509#(<= main_~x~0 48)} is VALID [2022-04-28 03:14:58,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {14420#true} call #t~ret4 := main(); {14420#true} is VALID [2022-04-28 03:14:58,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14420#true} {14420#true} #61#return; {14420#true} is VALID [2022-04-28 03:14:58,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#true} assume true; {14420#true} is VALID [2022-04-28 03:14:58,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {14420#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(9, 2); {14420#true} is VALID [2022-04-28 03:14:58,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {14420#true} call ULTIMATE.init(); {14420#true} is VALID [2022-04-28 03:14:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:58,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311698066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:58,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:58,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:14:59,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393300111] [2022-04-28 03:14:59,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393300111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:59,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:59,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:14:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290459835] [2022-04-28 03:14:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 88 [2022-04-28 03:14:59,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:59,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 03:14:59,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:14:59,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:14:59,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:59,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:14:59,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=2980, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:14:59,234 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 03:15:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:02,823 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-04-28 03:15:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:15:02,823 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 88 [2022-04-28 03:15:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 03:15:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2022-04-28 03:15:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 03:15:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2022-04-28 03:15:02,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 100 transitions. [2022-04-28 03:15:02,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:02,871 INFO L225 Difference]: With dead ends: 114 [2022-04-28 03:15:02,871 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 03:15:02,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=968, Invalid=10374, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:15:02,876 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 61 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:02,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 124 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:15:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 03:15:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-04-28 03:15:03,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:03,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 03:15:03,057 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 03:15:03,057 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 03:15:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:03,058 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-28 03:15:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-28 03:15:03,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:03,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:03,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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) Second operand 99 states. [2022-04-28 03:15:03,058 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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) Second operand 99 states. [2022-04-28 03:15:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:03,059 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-28 03:15:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-28 03:15:03,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:03,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:03,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:03,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 03:15:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-28 03:15:03,060 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 88 [2022-04-28 03:15:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:03,060 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-28 03:15:03,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 52 states have internal predecessors, (84), 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 03:15:03,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-28 03:15:03,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-28 03:15:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 03:15:03,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:03,171 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:03,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:03,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:15:03,387 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1320849149, now seen corresponding path program 27 times [2022-04-28 03:15:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:03,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479476986] [2022-04-28 03:15:03,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:03,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:03,739 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 99259083, now seen corresponding path program 1 times [2022-04-28 03:15:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:03,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937061766] [2022-04-28 03:15:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:03,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-28 03:15:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-28 03:15:03,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-28 03:15:03,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {15303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15295#true} is VALID [2022-04-28 03:15:03,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-28 03:15:03,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-28 03:15:03,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-28 03:15:03,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15300#(= main_~x~0 0)} is VALID [2022-04-28 03:15:03,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {15300#(= main_~x~0 0)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15300#(= main_~x~0 0)} is VALID [2022-04-28 03:15:03,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {15300#(= main_~x~0 0)} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15300#(= main_~x~0 0)} is VALID [2022-04-28 03:15:03,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {15300#(= main_~x~0 0)} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:15:03,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:15:03,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {15301#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15302#(<= 48 main_~y~0)} is VALID [2022-04-28 03:15:03,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {15302#(<= 48 main_~y~0)} assume ~y~0 < 0; {15296#false} is VALID [2022-04-28 03:15:03,804 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-28 03:15:03,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-28 03:15:03,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-28 03:15:03,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-28 03:15:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937061766] [2022-04-28 03:15:03,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937061766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967709464] [2022-04-28 03:15:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:03,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:03,805 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:03,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:15:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:03,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:15:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:03,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:03,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15295#true} is VALID [2022-04-28 03:15:03,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#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(9, 2); {15295#true} is VALID [2022-04-28 03:15:03,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-28 03:15:03,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-28 03:15:03,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-28 03:15:03,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15322#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:03,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {15322#(<= main_~x~0 0)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15322#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:03,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {15322#(<= main_~x~0 0)} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15322#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:03,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {15322#(<= main_~x~0 0)} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:15:03,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:15:03,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {15332#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15302#(<= 48 main_~y~0)} is VALID [2022-04-28 03:15:03,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {15302#(<= 48 main_~y~0)} assume ~y~0 < 0; {15296#false} is VALID [2022-04-28 03:15:03,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-28 03:15:03,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-28 03:15:03,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-28 03:15:03,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-28 03:15:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:03,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:04,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {15296#false} assume !false; {15296#false} is VALID [2022-04-28 03:15:04,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#false} assume 0 == ~cond; {15296#false} is VALID [2022-04-28 03:15:04,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#false} ~cond := #in~cond; {15296#false} is VALID [2022-04-28 03:15:04,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {15296#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {15296#false} is VALID [2022-04-28 03:15:04,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {15366#(not (< main_~y~0 0))} assume ~y~0 < 0; {15296#false} is VALID [2022-04-28 03:15:04,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {15366#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:04,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} [166] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:04,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [169] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_747 v_main_~x~0_746)) (.cse1 (= v_main_~y~0_821 v_main_~y~0_820)) (.cse2 (<= 0 (+ v_main_~y~0_821 1)))) (or (and .cse0 (= |v_main_#t~post3_363| |v_main_#t~post3_359|) (= |v_main_#t~post1_185| |v_main_#t~post1_184|) .cse1) (and (= |v_main_#t~post1_184| |v_main_#t~post1_185|) (= |v_main_#t~post3_359| |v_main_#t~post3_363|) .cse0 (or (not .cse2) (not (< v_main_~x~0_747 50))) .cse1) (and (= (+ v_main_~x~0_747 v_main_~y~0_820) (+ v_main_~x~0_746 v_main_~y~0_821)) (< v_main_~x~0_747 v_main_~x~0_746) (< v_main_~x~0_746 51) .cse2))) InVars {main_~y~0=v_main_~y~0_821, main_#t~post3=|v_main_#t~post3_363|, main_~x~0=v_main_~x~0_747, main_#t~post1=|v_main_#t~post1_185|} OutVars{main_~y~0=v_main_~y~0_820, main_#t~post3=|v_main_#t~post3_359|, main_~x~0=v_main_~x~0_746, main_#t~post1=|v_main_#t~post1_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {15370#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:04,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [168] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:04,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {15384#(<= main_~x~0 48)} [167] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_745 v_main_~x~0_744)) (.cse1 (= |v_main_#t~post2_203| |v_main_#t~post2_202|)) (.cse2 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse3 (<= 50 v_main_~x~0_745))) (or (and (= |v_main_#t~post3_358| |v_main_#t~post3_360|) .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_819)) (not .cse3))) (and (= |v_main_#t~post3_360| |v_main_#t~post3_358|) .cse0 .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_745 v_main_~y~0_819))) (and (< v_main_~x~0_745 v_main_~x~0_744) (<= v_main_~x~0_744 .cse4) .cse3 (= .cse4 (+ v_main_~x~0_744 v_main_~y~0_818)))))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post2=|v_main_#t~post2_203|, main_#t~post3=|v_main_#t~post3_360|, main_~x~0=v_main_~x~0_745} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post2=|v_main_#t~post2_202|, main_#t~post3=|v_main_#t~post3_358|, main_~x~0=v_main_~x~0_744} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {15377#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:04,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {15295#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {15384#(<= main_~x~0 48)} is VALID [2022-04-28 03:15:04,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {15295#true} call #t~ret4 := main(); {15295#true} is VALID [2022-04-28 03:15:04,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15295#true} {15295#true} #61#return; {15295#true} is VALID [2022-04-28 03:15:04,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {15295#true} assume true; {15295#true} is VALID [2022-04-28 03:15:04,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {15295#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(9, 2); {15295#true} is VALID [2022-04-28 03:15:04,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {15295#true} call ULTIMATE.init(); {15295#true} is VALID [2022-04-28 03:15:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967709464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:04,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:04,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:15:05,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:05,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479476986] [2022-04-28 03:15:05,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479476986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:05,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:05,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:15:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165357472] [2022-04-28 03:15:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 91 [2022-04-28 03:15:05,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:05,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 03:15:05,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:15:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:05,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:15:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:15:05,421 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 03:15:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:09,406 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-28 03:15:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:15:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 91 [2022-04-28 03:15:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 03:15:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2022-04-28 03:15:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 03:15:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2022-04-28 03:15:09,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 103 transitions. [2022-04-28 03:15:09,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:09,457 INFO L225 Difference]: With dead ends: 117 [2022-04-28 03:15:09,457 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 03:15:09,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:15:09,458 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:09,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 170 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:15:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 03:15:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-28 03:15:09,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:09,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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 03:15:09,653 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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 03:15:09,653 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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 03:15:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:09,654 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-04-28 03:15:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-28 03:15:09,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:09,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:09,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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) Second operand 102 states. [2022-04-28 03:15:09,654 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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) Second operand 102 states. [2022-04-28 03:15:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:09,655 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-04-28 03:15:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-28 03:15:09,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:09,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:09,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:09,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 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 03:15:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-28 03:15:09,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 91 [2022-04-28 03:15:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:09,657 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-28 03:15:09,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 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 03:15:09,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 105 transitions. [2022-04-28 03:15:09,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 03:15:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 03:15:09,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:09,776 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:09,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:09,992 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -635297113, now seen corresponding path program 28 times [2022-04-28 03:15:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:09,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490641360] [2022-04-28 03:15:10,147 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:10,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:10,291 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1690324021, now seen corresponding path program 1 times [2022-04-28 03:15:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:10,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829662488] [2022-04-28 03:15:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:10,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:10,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {16202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-28 03:15:10,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16199#(= main_~x~0 0)} is VALID [2022-04-28 03:15:10,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {16199#(= main_~x~0 0)} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16199#(= main_~x~0 0)} is VALID [2022-04-28 03:15:10,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {16199#(= main_~x~0 0)} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16199#(= main_~x~0 0)} is VALID [2022-04-28 03:15:10,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {16199#(= main_~x~0 0)} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:10,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:10,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {16200#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16201#(<= 48 main_~y~0)} is VALID [2022-04-28 03:15:10,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {16201#(<= 48 main_~y~0)} assume ~y~0 < 0; {16195#false} is VALID [2022-04-28 03:15:10,332 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-28 03:15:10,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-28 03:15:10,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-28 03:15:10,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-28 03:15:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829662488] [2022-04-28 03:15:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829662488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433910494] [2022-04-28 03:15:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:10,335 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:10,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:15:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:10,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:15:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:10,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16194#true} is VALID [2022-04-28 03:15:10,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#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(9, 2); {16194#true} is VALID [2022-04-28 03:15:10,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-28 03:15:10,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-28 03:15:10,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-28 03:15:10,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:10,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:10,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:10,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {16221#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:10,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:10,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {16231#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16238#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:10,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {16238#(<= 49 main_~y~0)} assume ~y~0 < 0; {16195#false} is VALID [2022-04-28 03:15:10,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-28 03:15:10,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-28 03:15:10,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-28 03:15:10,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-28 03:15:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:10,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:11,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {16195#false} assume !false; {16195#false} is VALID [2022-04-28 03:15:11,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {16195#false} assume 0 == ~cond; {16195#false} is VALID [2022-04-28 03:15:11,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {16195#false} ~cond := #in~cond; {16195#false} is VALID [2022-04-28 03:15:11,021 INFO L272 TraceCheckUtils]: 12: Hoare triple {16195#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {16195#false} is VALID [2022-04-28 03:15:11,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {16266#(not (< main_~y~0 0))} assume ~y~0 < 0; {16195#false} is VALID [2022-04-28 03:15:11,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {16266#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:11,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} [170] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:11,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [173] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_192| |v_main_#t~post1_191|)) (.cse1 (= v_main_~y~0_866 v_main_~y~0_865)) (.cse2 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse3 (= |v_main_#t~post3_377| |v_main_#t~post3_373|)) (.cse4 (<= 0 (+ v_main_~y~0_866 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_789 50)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_865))) (and (< .cse5 (+ 51 v_main_~y~0_866)) .cse4 (= (+ v_main_~x~0_788 v_main_~y~0_866) .cse5) (< v_main_~y~0_866 v_main_~y~0_865))))) InVars {main_~y~0=v_main_~y~0_866, main_#t~post3=|v_main_#t~post3_377|, main_~x~0=v_main_~x~0_789, main_#t~post1=|v_main_#t~post1_192|} OutVars{main_~y~0=v_main_~y~0_865, main_#t~post3=|v_main_#t~post3_373|, main_~x~0=v_main_~x~0_788, main_#t~post1=|v_main_#t~post1_191|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {16270#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:11,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [172] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:11,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {16284#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [171] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_787)) (.cse1 (= |v_main_#t~post2_211| |v_main_#t~post2_210|)) (.cse2 (= v_main_~y~0_864 v_main_~y~0_863)) (.cse3 (= |v_main_#t~post3_374| |v_main_#t~post3_372|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_864))) .cse1 (= v_main_~x~0_786 v_main_~x~0_787) .cse2 .cse3) (and .cse0 (<= 0 v_main_~y~0_863) (< v_main_~y~0_863 v_main_~y~0_864) (= (+ v_main_~x~0_787 v_main_~y~0_864) (+ v_main_~x~0_786 v_main_~y~0_863))) (and .cse1 .cse2 (= v_main_~x~0_787 v_main_~x~0_786) .cse3))) InVars {main_~y~0=v_main_~y~0_864, main_#t~post2=|v_main_#t~post2_211|, main_#t~post3=|v_main_#t~post3_374|, main_~x~0=v_main_~x~0_787} OutVars{main_~y~0=v_main_~y~0_863, main_#t~post2=|v_main_#t~post2_210|, main_#t~post3=|v_main_#t~post3_372|, main_~x~0=v_main_~x~0_786} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {16277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:11,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {16194#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {16284#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:15:11,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {16194#true} call #t~ret4 := main(); {16194#true} is VALID [2022-04-28 03:15:11,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16194#true} {16194#true} #61#return; {16194#true} is VALID [2022-04-28 03:15:11,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {16194#true} assume true; {16194#true} is VALID [2022-04-28 03:15:11,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {16194#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(9, 2); {16194#true} is VALID [2022-04-28 03:15:11,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {16194#true} call ULTIMATE.init(); {16194#true} is VALID [2022-04-28 03:15:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:11,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433910494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:11,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:15:12,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:12,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490641360] [2022-04-28 03:15:12,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490641360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:12,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:12,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:15:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803399481] [2022-04-28 03:15:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 94 [2022-04-28 03:15:12,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:12,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 03:15:12,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:15:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:15:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=3576, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:15:12,288 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 03:15:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:16,990 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-04-28 03:15:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:15:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 94 [2022-04-28 03:15:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 03:15:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 106 transitions. [2022-04-28 03:15:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 03:15:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 106 transitions. [2022-04-28 03:15:16,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 106 transitions. [2022-04-28 03:15:17,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:17,099 INFO L225 Difference]: With dead ends: 120 [2022-04-28 03:15:17,099 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 03:15:17,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3794 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=998, Invalid=12342, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:15:17,100 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3336 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:17,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 61 Invalid, 3469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3336 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:15:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 03:15:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-28 03:15:17,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:17,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 03:15:17,393 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 03:15:17,393 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 03:15:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:17,394 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-28 03:15:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-28 03:15:17,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:17,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:17,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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) Second operand 105 states. [2022-04-28 03:15:17,395 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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) Second operand 105 states. [2022-04-28 03:15:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:17,405 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-28 03:15:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-28 03:15:17,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:17,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:17,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:17,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 03:15:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-28 03:15:17,406 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 94 [2022-04-28 03:15:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-28 03:15:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 56 states have internal predecessors, (90), 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 03:15:17,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-28 03:15:17,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-28 03:15:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 03:15:17,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:17,525 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:17,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:17,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:17,740 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 75914883, now seen corresponding path program 29 times [2022-04-28 03:15:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:17,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821315671] [2022-04-28 03:15:21,874 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:21,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:22,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:22,169 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 815060171, now seen corresponding path program 1 times [2022-04-28 03:15:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:22,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208559885] [2022-04-28 03:15:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:22,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-28 03:15:22,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-28 03:15:22,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-28 03:15:22,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:22,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17118#true} is VALID [2022-04-28 03:15:22,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-28 03:15:22,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-28 03:15:22,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-28 03:15:22,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17123#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:22,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {17123#(and (= main_~x~0 0) (= main_~y~0 0))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {17124#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {17125#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17126#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:22,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {17126#(<= 49 main_~y~0)} assume ~y~0 < 0; {17119#false} is VALID [2022-04-28 03:15:22,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-28 03:15:22,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-28 03:15:22,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-28 03:15:22,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-28 03:15:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208559885] [2022-04-28 03:15:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208559885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035848714] [2022-04-28 03:15:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:22,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:22,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:22,230 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:22,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:15:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:22,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:15:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:22,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:22,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17118#true} is VALID [2022-04-28 03:15:22,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#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(9, 2); {17118#true} is VALID [2022-04-28 03:15:22,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-28 03:15:22,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-28 03:15:22,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-28 03:15:22,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:22,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {17146#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:22,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:22,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {17156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17126#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:22,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {17126#(<= 49 main_~y~0)} assume ~y~0 < 0; {17119#false} is VALID [2022-04-28 03:15:22,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-28 03:15:22,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-28 03:15:22,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-28 03:15:22,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-28 03:15:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:22,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:22,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {17119#false} assume !false; {17119#false} is VALID [2022-04-28 03:15:22,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {17119#false} assume 0 == ~cond; {17119#false} is VALID [2022-04-28 03:15:22,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {17119#false} ~cond := #in~cond; {17119#false} is VALID [2022-04-28 03:15:22,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {17119#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {17119#false} is VALID [2022-04-28 03:15:22,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {17190#(not (< main_~y~0 0))} assume ~y~0 < 0; {17119#false} is VALID [2022-04-28 03:15:22,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {17190#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:22,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} [174] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:22,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [177] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_912 v_main_~y~0_911)) (.cse2 (= v_main_~x~0_832 v_main_~x~0_831)) (.cse3 (= |v_main_#t~post3_391| |v_main_#t~post3_387|)) (.cse4 (= |v_main_#t~post1_199| |v_main_#t~post1_198|)) (.cse1 (<= 0 (+ v_main_~y~0_912 1)))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_832 50))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_832 v_main_~x~0_831) .cse1 (< v_main_~x~0_831 51) (= (+ v_main_~x~0_831 v_main_~y~0_912) (+ v_main_~x~0_832 v_main_~y~0_911))))) InVars {main_~y~0=v_main_~y~0_912, main_#t~post3=|v_main_#t~post3_391|, main_~x~0=v_main_~x~0_832, main_#t~post1=|v_main_#t~post1_199|} OutVars{main_~y~0=v_main_~y~0_911, main_#t~post3=|v_main_#t~post3_387|, main_~x~0=v_main_~x~0_831, main_#t~post1=|v_main_#t~post1_198|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {17194#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:22,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [176] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:22,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {17208#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [175] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_830)) (.cse1 (= |v_main_#t~post2_219| |v_main_#t~post2_218|)) (.cse2 (= v_main_~y~0_910 v_main_~y~0_909)) (.cse3 (= |v_main_#t~post3_388| |v_main_#t~post3_386|))) (or (and (= (+ v_main_~x~0_830 v_main_~y~0_910) (+ v_main_~x~0_829 v_main_~y~0_909)) (<= 0 v_main_~y~0_909) .cse0 (< v_main_~y~0_909 v_main_~y~0_910)) (and (or (not .cse0) (not (<= 1 v_main_~y~0_910))) .cse1 .cse2 .cse3 (= v_main_~x~0_829 v_main_~x~0_830)) (and (= v_main_~x~0_830 v_main_~x~0_829) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_910, main_#t~post2=|v_main_#t~post2_219|, main_#t~post3=|v_main_#t~post3_388|, main_~x~0=v_main_~x~0_830} OutVars{main_~y~0=v_main_~y~0_909, main_#t~post2=|v_main_#t~post2_218|, main_#t~post3=|v_main_#t~post3_386|, main_~x~0=v_main_~x~0_829} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {17201#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:22,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {17118#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {17208#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:15:22,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {17118#true} call #t~ret4 := main(); {17118#true} is VALID [2022-04-28 03:15:22,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17118#true} {17118#true} #61#return; {17118#true} is VALID [2022-04-28 03:15:22,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {17118#true} assume true; {17118#true} is VALID [2022-04-28 03:15:22,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {17118#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(9, 2); {17118#true} is VALID [2022-04-28 03:15:22,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {17118#true} call ULTIMATE.init(); {17118#true} is VALID [2022-04-28 03:15:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035848714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:22,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:22,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2022-04-28 03:15:24,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821315671] [2022-04-28 03:15:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821315671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:24,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:24,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:15:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838480006] [2022-04-28 03:15:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 97 [2022-04-28 03:15:24,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:24,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 03:15:24,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:24,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:15:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:15:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3934, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:15:24,333 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 03:15:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:32,110 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2022-04-28 03:15:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:15:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 97 [2022-04-28 03:15:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 03:15:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 109 transitions. [2022-04-28 03:15:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 03:15:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 109 transitions. [2022-04-28 03:15:32,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 109 transitions. [2022-04-28 03:15:32,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:32,193 INFO L225 Difference]: With dead ends: 123 [2022-04-28 03:15:32,193 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 03:15:32,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2429 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1103, Invalid=13903, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 03:15:32,194 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4884 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 4998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:32,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 212 Invalid, 4998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4884 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:15:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 03:15:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-28 03:15:32,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:32,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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 03:15:32,518 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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 03:15:32,518 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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 03:15:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:32,519 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 03:15:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-28 03:15:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:32,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:32,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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) Second operand 108 states. [2022-04-28 03:15:32,520 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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) Second operand 108 states. [2022-04-28 03:15:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:32,520 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 03:15:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-28 03:15:32,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:32,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:32,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:32,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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 03:15:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-04-28 03:15:32,522 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 97 [2022-04-28 03:15:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:32,522 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-04-28 03:15:32,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 59 states have internal predecessors, (93), 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 03:15:32,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 111 transitions. [2022-04-28 03:15:32,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-28 03:15:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 03:15:32,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:32,646 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:32,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 03:15:32,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:32,846 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 718816551, now seen corresponding path program 30 times [2022-04-28 03:15:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:32,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546864557] [2022-04-28 03:15:33,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:33,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:33,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -974522933, now seen corresponding path program 1 times [2022-04-28 03:15:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:33,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868720835] [2022-04-28 03:15:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:33,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-28 03:15:33,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-28 03:15:33,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-28 03:15:33,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:33,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {18080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18071#true} is VALID [2022-04-28 03:15:33,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-28 03:15:33,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-28 03:15:33,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-28 03:15:33,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18076#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:33,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {18076#(and (= main_~x~0 0) (= main_~y~0 0))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18077#(= main_~x~0 0)} is VALID [2022-04-28 03:15:33,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {18077#(= main_~x~0 0)} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18077#(= main_~x~0 0)} is VALID [2022-04-28 03:15:33,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {18077#(= main_~x~0 0)} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:33,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:33,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {18078#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18079#(<= 48 main_~y~0)} is VALID [2022-04-28 03:15:33,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {18079#(<= 48 main_~y~0)} assume ~y~0 < 0; {18072#false} is VALID [2022-04-28 03:15:33,364 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-28 03:15:33,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-28 03:15:33,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-28 03:15:33,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-28 03:15:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868720835] [2022-04-28 03:15:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868720835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839520606] [2022-04-28 03:15:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:33,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:33,365 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:33,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:15:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:33,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:15:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:33,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:33,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18071#true} is VALID [2022-04-28 03:15:33,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#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(9, 2); {18071#true} is VALID [2022-04-28 03:15:33,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-28 03:15:33,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-28 03:15:33,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-28 03:15:33,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:33,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:33,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:33,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {18099#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:33,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:33,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {18109#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18116#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:33,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {18116#(<= 49 main_~y~0)} assume ~y~0 < 0; {18072#false} is VALID [2022-04-28 03:15:33,647 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-28 03:15:33,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-28 03:15:33,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-28 03:15:33,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-28 03:15:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:33,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:34,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {18072#false} assume !false; {18072#false} is VALID [2022-04-28 03:15:34,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {18072#false} assume 0 == ~cond; {18072#false} is VALID [2022-04-28 03:15:34,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {18072#false} ~cond := #in~cond; {18072#false} is VALID [2022-04-28 03:15:34,077 INFO L272 TraceCheckUtils]: 12: Hoare triple {18072#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {18072#false} is VALID [2022-04-28 03:15:34,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {18144#(not (< main_~y~0 0))} assume ~y~0 < 0; {18072#false} is VALID [2022-04-28 03:15:34,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {18144#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:34,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} [178] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:34,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [181] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_959 1))) (.cse1 (= |v_main_#t~post1_206| |v_main_#t~post1_205|)) (.cse2 (= v_main_~y~0_959 v_main_~y~0_958)) (.cse3 (= |v_main_#t~post3_405| |v_main_#t~post3_401|)) (.cse4 (= v_main_~x~0_876 v_main_~x~0_875))) (or (and (< v_main_~x~0_875 51) .cse0 (= (+ v_main_~x~0_876 v_main_~y~0_958) (+ v_main_~x~0_875 v_main_~y~0_959)) (< v_main_~x~0_876 v_main_~x~0_875)) (and (or (not .cse0) (not (< v_main_~x~0_876 50))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_959, main_#t~post3=|v_main_#t~post3_405|, main_~x~0=v_main_~x~0_876, main_#t~post1=|v_main_#t~post1_206|} OutVars{main_~y~0=v_main_~y~0_958, main_#t~post3=|v_main_#t~post3_401|, main_~x~0=v_main_~x~0_875, main_#t~post1=|v_main_#t~post1_205|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {18148#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:34,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [180] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:34,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {18162#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [179] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_874)) (.cse1 (= v_main_~y~0_957 v_main_~y~0_956)) (.cse2 (= v_main_~x~0_874 v_main_~x~0_873)) (.cse3 (= |v_main_#t~post2_227| |v_main_#t~post2_226|)) (.cse4 (= |v_main_#t~post3_402| |v_main_#t~post3_400|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_957))) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_874 v_main_~y~0_957))) (and (= (+ v_main_~x~0_873 v_main_~y~0_956) .cse5) (< v_main_~x~0_874 v_main_~x~0_873) .cse0 (<= v_main_~x~0_873 .cse5))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_957, main_#t~post2=|v_main_#t~post2_227|, main_#t~post3=|v_main_#t~post3_402|, main_~x~0=v_main_~x~0_874} OutVars{main_~y~0=v_main_~y~0_956, main_#t~post2=|v_main_#t~post2_226|, main_#t~post3=|v_main_#t~post3_400|, main_~x~0=v_main_~x~0_873} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {18155#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:34,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {18071#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {18162#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:15:34,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {18071#true} call #t~ret4 := main(); {18071#true} is VALID [2022-04-28 03:15:34,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18071#true} {18071#true} #61#return; {18071#true} is VALID [2022-04-28 03:15:34,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {18071#true} assume true; {18071#true} is VALID [2022-04-28 03:15:34,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {18071#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(9, 2); {18071#true} is VALID [2022-04-28 03:15:34,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {18071#true} call ULTIMATE.init(); {18071#true} is VALID [2022-04-28 03:15:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839520606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:34,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:15:35,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546864557] [2022-04-28 03:15:35,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546864557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:35,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:35,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:15:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908958059] [2022-04-28 03:15:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 100 [2022-04-28 03:15:35,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:35,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 03:15:35,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:15:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:15:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4321, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:15:35,772 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 03:15:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:42,159 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-04-28 03:15:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:15:42,160 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 100 [2022-04-28 03:15:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 03:15:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2022-04-28 03:15:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 03:15:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2022-04-28 03:15:42,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 112 transitions. [2022-04-28 03:15:42,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:42,219 INFO L225 Difference]: With dead ends: 126 [2022-04-28 03:15:42,219 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 03:15:42,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1146, Invalid=15110, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:15:42,220 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:42,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 333 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:15:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 03:15:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-04-28 03:15:42,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:42,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 03:15:42,435 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 03:15:42,435 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 03:15:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:42,451 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 03:15:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 03:15:42,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:42,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:42,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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) Second operand 111 states. [2022-04-28 03:15:42,452 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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) Second operand 111 states. [2022-04-28 03:15:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:42,453 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 03:15:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 03:15:42,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:42,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:42,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:42,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 03:15:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-28 03:15:42,454 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 100 [2022-04-28 03:15:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:42,454 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-28 03:15:42,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 61 states have internal predecessors, (96), 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 03:15:42,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-28 03:15:42,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-28 03:15:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 03:15:42,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:42,560 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:42,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:15:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:42,779 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2143235075, now seen corresponding path program 31 times [2022-04-28 03:15:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915222290] [2022-04-28 03:15:42,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:47,038 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:47,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:47,134 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1530861259, now seen corresponding path program 1 times [2022-04-28 03:15:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:47,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580475106] [2022-04-28 03:15:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:47,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-28 03:15:47,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-28 03:15:47,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-28 03:15:47,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:47,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {19057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19049#true} is VALID [2022-04-28 03:15:47,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-28 03:15:47,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-28 03:15:47,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-28 03:15:47,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:47,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:47,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:47,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {19054#(and (= main_~x~0 0) (= main_~y~0 0))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:47,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:47,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {19055#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19056#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:47,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {19056#(<= 49 main_~y~0)} assume ~y~0 < 0; {19050#false} is VALID [2022-04-28 03:15:47,211 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-28 03:15:47,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-28 03:15:47,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-28 03:15:47,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-28 03:15:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580475106] [2022-04-28 03:15:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580475106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389422286] [2022-04-28 03:15:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:47,212 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:47,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:15:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:47,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:15:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:47,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:47,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19049#true} is VALID [2022-04-28 03:15:47,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#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(9, 2); {19049#true} is VALID [2022-04-28 03:15:47,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-28 03:15:47,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-28 03:15:47,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-28 03:15:47,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:47,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:47,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:47,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {19076#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:47,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:15:47,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {19086#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19056#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:47,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {19056#(<= 49 main_~y~0)} assume ~y~0 < 0; {19050#false} is VALID [2022-04-28 03:15:47,527 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-28 03:15:47,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-28 03:15:47,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-28 03:15:47,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-28 03:15:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:47,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:47,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#false} assume !false; {19050#false} is VALID [2022-04-28 03:15:47,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#false} assume 0 == ~cond; {19050#false} is VALID [2022-04-28 03:15:47,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#false} ~cond := #in~cond; {19050#false} is VALID [2022-04-28 03:15:47,964 INFO L272 TraceCheckUtils]: 12: Hoare triple {19050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {19050#false} is VALID [2022-04-28 03:15:47,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {19120#(not (< main_~y~0 0))} assume ~y~0 < 0; {19050#false} is VALID [2022-04-28 03:15:47,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {19120#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:47,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} [182] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:47,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [185] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1007 1))) (.cse1 (= v_main_~y~0_1007 v_main_~y~0_1006)) (.cse2 (= v_main_~x~0_921 v_main_~x~0_920)) (.cse3 (= |v_main_#t~post1_213| |v_main_#t~post1_212|))) (or (and .cse0 (< v_main_~x~0_921 v_main_~x~0_920) (< v_main_~x~0_920 51) (= (+ v_main_~x~0_921 v_main_~y~0_1006) (+ v_main_~x~0_920 v_main_~y~0_1007))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post3_419| |v_main_#t~post3_415|)) (and (or (not .cse0) (not (< v_main_~x~0_921 50))) .cse1 .cse2 .cse3 (= |v_main_#t~post3_415| |v_main_#t~post3_419|)))) InVars {main_~y~0=v_main_~y~0_1007, main_#t~post3=|v_main_#t~post3_419|, main_~x~0=v_main_~x~0_921, main_#t~post1=|v_main_#t~post1_213|} OutVars{main_~y~0=v_main_~y~0_1006, main_#t~post3=|v_main_#t~post3_415|, main_~x~0=v_main_~x~0_920, main_#t~post1=|v_main_#t~post1_212|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {19124#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:47,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [184] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:47,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {19138#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [183] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_919 v_main_~x~0_918)) (.cse1 (= |v_main_#t~post2_235| |v_main_#t~post2_234|)) (.cse2 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse3 (= v_main_~y~0_1005 v_main_~y~0_1004)) (.cse4 (<= 50 v_main_~x~0_919))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (<= 1 v_main_~y~0_1005)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_918 v_main_~y~0_1004) (+ v_main_~x~0_919 v_main_~y~0_1005)) .cse4 (<= 0 v_main_~y~0_1004) (< v_main_~y~0_1004 v_main_~y~0_1005)))) InVars {main_~y~0=v_main_~y~0_1005, main_#t~post2=|v_main_#t~post2_235|, main_#t~post3=|v_main_#t~post3_416|, main_~x~0=v_main_~x~0_919} OutVars{main_~y~0=v_main_~y~0_1004, main_#t~post2=|v_main_#t~post2_234|, main_#t~post3=|v_main_#t~post3_414|, main_~x~0=v_main_~x~0_918} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {19131#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:47,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {19049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {19138#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:15:47,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {19049#true} call #t~ret4 := main(); {19049#true} is VALID [2022-04-28 03:15:47,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19049#true} {19049#true} #61#return; {19049#true} is VALID [2022-04-28 03:15:47,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {19049#true} assume true; {19049#true} is VALID [2022-04-28 03:15:47,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {19049#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(9, 2); {19049#true} is VALID [2022-04-28 03:15:47,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {19049#true} call ULTIMATE.init(); {19049#true} is VALID [2022-04-28 03:15:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:47,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389422286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:47,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:47,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:15:49,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:49,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915222290] [2022-04-28 03:15:49,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915222290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:49,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:49,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:15:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407179154] [2022-04-28 03:15:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 103 [2022-04-28 03:15:49,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:49,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 03:15:49,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:15:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:15:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=4319, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:15:49,352 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 03:15:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:55,682 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-04-28 03:15:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:15:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 103 [2022-04-28 03:15:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 03:15:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 115 transitions. [2022-04-28 03:15:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 03:15:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 115 transitions. [2022-04-28 03:15:55,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 115 transitions. [2022-04-28 03:15:55,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:55,765 INFO L225 Difference]: With dead ends: 129 [2022-04-28 03:15:55,766 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 03:15:55,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2541 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1168, Invalid=15602, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:15:55,767 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:55,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 139 Invalid, 5610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 5488 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:15:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 03:15:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-28 03:15:55,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:55,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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 03:15:55,987 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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 03:15:55,987 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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 03:15:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:55,988 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-04-28 03:15:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-28 03:15:55,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:55,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:55,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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) Second operand 114 states. [2022-04-28 03:15:55,988 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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) Second operand 114 states. [2022-04-28 03:15:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:55,989 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-04-28 03:15:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-28 03:15:55,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:55,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:55,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:55,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 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 03:15:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2022-04-28 03:15:55,990 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 103 [2022-04-28 03:15:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:55,991 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2022-04-28 03:15:55,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.546875) internal successors, (99), 63 states have internal predecessors, (99), 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 03:15:55,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 117 transitions. [2022-04-28 03:15:56,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-04-28 03:15:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 03:15:56,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:56,095 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:56,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:56,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 03:15:56,296 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1576368217, now seen corresponding path program 32 times [2022-04-28 03:15:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926525912] [2022-04-28 03:15:56,428 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:56,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:15:56,558 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -258721845, now seen corresponding path program 1 times [2022-04-28 03:15:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614652006] [2022-04-28 03:15:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:56,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-28 03:15:56,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-28 03:15:56,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-28 03:15:56,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:56,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {20058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {20049#true} is VALID [2022-04-28 03:15:56,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-28 03:15:56,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-28 03:15:56,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-28 03:15:56,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20054#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:15:56,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {20054#(and (= main_~x~0 0) (= main_~y~0 0))} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:56,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:56,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {20055#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {20056#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20057#(<= 49 main_~y~0)} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {20057#(<= 49 main_~y~0)} assume ~y~0 < 0; {20050#false} is VALID [2022-04-28 03:15:56,605 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-28 03:15:56,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-28 03:15:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:56,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614652006] [2022-04-28 03:15:56,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614652006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:56,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966504669] [2022-04-28 03:15:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:56,620 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:56,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 03:15:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:56,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:15:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:56,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:56,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20049#true} is VALID [2022-04-28 03:15:56,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#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(9, 2); {20049#true} is VALID [2022-04-28 03:15:56,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-28 03:15:56,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-28 03:15:56,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-28 03:15:56,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20077#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:56,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {20077#(<= main_~x~0 0)} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20077#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:56,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {20077#(<= main_~x~0 0)} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20077#(<= main_~x~0 0)} is VALID [2022-04-28 03:15:56,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {20077#(<= main_~x~0 0)} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:15:56,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:15:56,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {20087#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20094#(<= 48 main_~y~0)} is VALID [2022-04-28 03:15:56,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {20094#(<= 48 main_~y~0)} assume ~y~0 < 0; {20050#false} is VALID [2022-04-28 03:15:56,818 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-28 03:15:56,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-28 03:15:56,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-28 03:15:56,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-28 03:15:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:15:56,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:57,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-28 03:15:57,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {20050#false} assume 0 == ~cond; {20050#false} is VALID [2022-04-28 03:15:57,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#false} ~cond := #in~cond; {20050#false} is VALID [2022-04-28 03:15:57,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {20050#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {20050#false} is VALID [2022-04-28 03:15:57,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {20122#(not (< main_~y~0 0))} assume ~y~0 < 0; {20050#false} is VALID [2022-04-28 03:15:57,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {20122#(not (< main_~y~0 0))} is VALID [2022-04-28 03:15:57,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} [186] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:57,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [189] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~x~0_967 v_main_~x~0_966)) (.cse2 (= v_main_~y~0_1056 v_main_~y~0_1055)) (.cse0 (<= 0 (+ v_main_~y~0_1056 1))) (.cse3 (= |v_main_#t~post3_433| |v_main_#t~post3_429|))) (or (and (< v_main_~x~0_966 51) .cse0 (= (+ v_main_~x~0_966 v_main_~y~0_1056) (+ v_main_~x~0_967 v_main_~y~0_1055)) (< v_main_~x~0_967 v_main_~x~0_966)) (and (= |v_main_#t~post1_220| |v_main_#t~post1_219|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post1_219| |v_main_#t~post1_220|) .cse1 .cse2 (or (not (< v_main_~x~0_967 50)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_1056, main_#t~post3=|v_main_#t~post3_433|, main_~x~0=v_main_~x~0_967, main_#t~post1=|v_main_#t~post1_220|} OutVars{main_~y~0=v_main_~y~0_1055, main_#t~post3=|v_main_#t~post3_429|, main_~x~0=v_main_~x~0_966, main_#t~post1=|v_main_#t~post1_219|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {20126#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:15:57,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [188] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:57,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {20140#(<= main_~x~0 48)} [187] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_965)) (.cse1 (= |v_main_#t~post3_430| |v_main_#t~post3_428|)) (.cse2 (= |v_main_#t~post2_243| |v_main_#t~post2_242|)) (.cse3 (= v_main_~x~0_965 v_main_~x~0_964)) (.cse4 (= v_main_~y~0_1054 v_main_~y~0_1053))) (or (and (<= 0 v_main_~y~0_1053) (= (+ v_main_~x~0_965 v_main_~y~0_1054) (+ v_main_~x~0_964 v_main_~y~0_1053)) (< v_main_~y~0_1053 v_main_~y~0_1054) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (<= 1 v_main_~y~0_1054)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1054, main_#t~post2=|v_main_#t~post2_243|, main_#t~post3=|v_main_#t~post3_430|, main_~x~0=v_main_~x~0_965} OutVars{main_~y~0=v_main_~y~0_1053, main_#t~post2=|v_main_#t~post2_242|, main_#t~post3=|v_main_#t~post3_428|, main_~x~0=v_main_~x~0_964} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {20133#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:15:57,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {20140#(<= main_~x~0 48)} is VALID [2022-04-28 03:15:57,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret4 := main(); {20049#true} is VALID [2022-04-28 03:15:57,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #61#return; {20049#true} is VALID [2022-04-28 03:15:57,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-28 03:15:57,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#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(9, 2); {20049#true} is VALID [2022-04-28 03:15:57,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20049#true} is VALID [2022-04-28 03:15:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:15:57,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966504669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:57,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:57,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:15:58,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926525912] [2022-04-28 03:15:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926525912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:58,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:15:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000811912] [2022-04-28 03:15:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 106 [2022-04-28 03:15:58,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:58,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 03:15:59,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:59,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:15:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:15:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4862, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:15:59,025 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 03:16:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:05,960 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-04-28 03:16:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:16:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 106 [2022-04-28 03:16:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 03:16:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2022-04-28 03:16:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 03:16:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2022-04-28 03:16:05,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 118 transitions. [2022-04-28 03:16:06,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:06,079 INFO L225 Difference]: With dead ends: 132 [2022-04-28 03:16:06,079 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 03:16:06,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1221, Invalid=17139, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:16:06,080 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 6051 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 6177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:06,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 6177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6051 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:16:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 03:16:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-04-28 03:16:06,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:06,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 03:16:06,320 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 03:16:06,320 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 03:16:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:06,321 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-28 03:16:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-28 03:16:06,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:06,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:06,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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) Second operand 117 states. [2022-04-28 03:16:06,321 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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) Second operand 117 states. [2022-04-28 03:16:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:06,322 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-28 03:16:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-28 03:16:06,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:06,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:06,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:06,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 03:16:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-28 03:16:06,324 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 106 [2022-04-28 03:16:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:06,324 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-28 03:16:06,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 65 states have internal predecessors, (102), 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 03:16:06,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-28 03:16:06,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 03:16:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 03:16:06,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:06,499 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:06,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:06,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:06,715 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2121803389, now seen corresponding path program 33 times [2022-04-28 03:16:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:06,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099474177] [2022-04-28 03:16:06,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:07,039 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:07,040 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2048304949, now seen corresponding path program 1 times [2022-04-28 03:16:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:07,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365175717] [2022-04-28 03:16:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:07,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:07,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {21083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-28 03:16:07,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-28 03:16:07,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21080#(= main_~x~0 0)} is VALID [2022-04-28 03:16:07,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {21080#(= main_~x~0 0)} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21080#(= main_~x~0 0)} is VALID [2022-04-28 03:16:07,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {21080#(= main_~x~0 0)} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21080#(= main_~x~0 0)} is VALID [2022-04-28 03:16:07,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {21080#(= main_~x~0 0)} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:07,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:07,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {21081#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21082#(<= 48 main_~y~0)} is VALID [2022-04-28 03:16:07,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {21082#(<= 48 main_~y~0)} assume ~y~0 < 0; {21076#false} is VALID [2022-04-28 03:16:07,101 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-28 03:16:07,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-28 03:16:07,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-28 03:16:07,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-28 03:16:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:07,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365175717] [2022-04-28 03:16:07,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365175717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:07,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238223532] [2022-04-28 03:16:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:07,103 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:16:07,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 03:16:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:07,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:16:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:07,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:07,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21075#true} is VALID [2022-04-28 03:16:07,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#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(9, 2); {21075#true} is VALID [2022-04-28 03:16:07,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-28 03:16:07,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-28 03:16:07,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-28 03:16:07,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:07,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:07,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:07,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {21102#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:16:07,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:16:07,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {21112#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21119#(<= 49 main_~y~0)} is VALID [2022-04-28 03:16:07,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {21119#(<= 49 main_~y~0)} assume ~y~0 < 0; {21076#false} is VALID [2022-04-28 03:16:07,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-28 03:16:07,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-28 03:16:07,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-28 03:16:07,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-28 03:16:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:07,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:07,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {21076#false} assume !false; {21076#false} is VALID [2022-04-28 03:16:07,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {21076#false} assume 0 == ~cond; {21076#false} is VALID [2022-04-28 03:16:07,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {21076#false} ~cond := #in~cond; {21076#false} is VALID [2022-04-28 03:16:07,598 INFO L272 TraceCheckUtils]: 12: Hoare triple {21076#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {21076#false} is VALID [2022-04-28 03:16:07,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {21147#(not (< main_~y~0 0))} assume ~y~0 < 0; {21076#false} is VALID [2022-04-28 03:16:07,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {21147#(not (< main_~y~0 0))} is VALID [2022-04-28 03:16:07,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} [190] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:07,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [193] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1014 v_main_~x~0_1013)) (.cse5 (<= 0 (+ v_main_~y~0_1106 1))) (.cse1 (= v_main_~y~0_1106 v_main_~y~0_1105)) (.cse2 (= |v_main_#t~post1_227| |v_main_#t~post1_226|)) (.cse3 (= |v_main_#t~post3_447| |v_main_#t~post3_443|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1014 v_main_~y~0_1105))) (and (= .cse4 (+ v_main_~x~0_1013 v_main_~y~0_1106)) .cse5 (< .cse4 (+ 51 v_main_~y~0_1106)) (< v_main_~y~0_1106 v_main_~y~0_1105))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_1014 50))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1106, main_#t~post3=|v_main_#t~post3_447|, main_~x~0=v_main_~x~0_1014, main_#t~post1=|v_main_#t~post1_227|} OutVars{main_~y~0=v_main_~y~0_1105, main_#t~post3=|v_main_#t~post3_443|, main_~x~0=v_main_~x~0_1013, main_#t~post1=|v_main_#t~post1_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {21151#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:07,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [192] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:07,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {21165#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [191] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 50 v_main_~x~0_1012)) (.cse0 (= |v_main_#t~post2_251| |v_main_#t~post2_250|)) (.cse1 (= |v_main_#t~post3_444| |v_main_#t~post3_442|)) (.cse2 (= v_main_~x~0_1012 v_main_~x~0_1011)) (.cse3 (= v_main_~y~0_1104 v_main_~y~0_1103))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (<= 1 v_main_~y~0_1104)))) (let ((.cse5 (+ v_main_~x~0_1012 v_main_~y~0_1104))) (and (< v_main_~x~0_1012 v_main_~x~0_1011) (<= v_main_~x~0_1011 .cse5) (= .cse5 (+ v_main_~x~0_1011 v_main_~y~0_1103)) .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1104, main_#t~post2=|v_main_#t~post2_251|, main_#t~post3=|v_main_#t~post3_444|, main_~x~0=v_main_~x~0_1012} OutVars{main_~y~0=v_main_~y~0_1103, main_#t~post2=|v_main_#t~post2_250|, main_#t~post3=|v_main_#t~post3_442|, main_~x~0=v_main_~x~0_1011} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {21158#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:07,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {21075#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {21165#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:16:07,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {21075#true} call #t~ret4 := main(); {21075#true} is VALID [2022-04-28 03:16:07,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21075#true} {21075#true} #61#return; {21075#true} is VALID [2022-04-28 03:16:07,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {21075#true} assume true; {21075#true} is VALID [2022-04-28 03:16:07,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {21075#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(9, 2); {21075#true} is VALID [2022-04-28 03:16:07,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {21075#true} call ULTIMATE.init(); {21075#true} is VALID [2022-04-28 03:16:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:07,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238223532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:07,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:07,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:16:08,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:08,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099474177] [2022-04-28 03:16:08,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099474177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:08,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:08,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:16:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430578297] [2022-04-28 03:16:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 109 [2022-04-28 03:16:08,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:08,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 03:16:08,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:16:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:16:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=4866, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:16:08,914 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 03:16:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:14,423 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-04-28 03:16:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:16:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 109 [2022-04-28 03:16:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 03:16:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 121 transitions. [2022-04-28 03:16:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 03:16:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 121 transitions. [2022-04-28 03:16:14,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 121 transitions. [2022-04-28 03:16:14,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:14,482 INFO L225 Difference]: With dead ends: 135 [2022-04-28 03:16:14,482 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:16:14,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5294 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1183, Invalid=17177, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:16:14,483 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4567 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 4702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:14,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 226 Invalid, 4702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4567 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:16:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:16:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-28 03:16:14,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:14,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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 03:16:14,729 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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 03:16:14,729 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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 03:16:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:14,730 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-04-28 03:16:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-28 03:16:14,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:14,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:14,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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) Second operand 120 states. [2022-04-28 03:16:14,730 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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) Second operand 120 states. [2022-04-28 03:16:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:14,731 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-04-28 03:16:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-28 03:16:14,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:14,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:14,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:14,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 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 03:16:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-04-28 03:16:14,733 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 109 [2022-04-28 03:16:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-04-28 03:16:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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 03:16:14,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 123 transitions. [2022-04-28 03:16:14,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-04-28 03:16:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 03:16:14,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:14,857 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:14,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:15,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:15,074 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash 975235623, now seen corresponding path program 34 times [2022-04-28 03:16:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:15,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042036421] [2022-04-28 03:16:15,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:15,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:15,417 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 457079243, now seen corresponding path program 1 times [2022-04-28 03:16:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:15,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229615035] [2022-04-28 03:16:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:15,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-28 03:16:15,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-28 03:16:15,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-28 03:16:15,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:15,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {22127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22119#true} is VALID [2022-04-28 03:16:15,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-28 03:16:15,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-28 03:16:15,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-28 03:16:15,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22124#(= main_~x~0 0)} is VALID [2022-04-28 03:16:15,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {22124#(= main_~x~0 0)} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22124#(= main_~x~0 0)} is VALID [2022-04-28 03:16:15,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {22124#(= main_~x~0 0)} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22124#(= main_~x~0 0)} is VALID [2022-04-28 03:16:15,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {22124#(= main_~x~0 0)} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:15,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:15,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {22125#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22126#(<= 48 main_~y~0)} is VALID [2022-04-28 03:16:15,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {22126#(<= 48 main_~y~0)} assume ~y~0 < 0; {22120#false} is VALID [2022-04-28 03:16:15,472 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-28 03:16:15,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-28 03:16:15,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-28 03:16:15,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-28 03:16:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229615035] [2022-04-28 03:16:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229615035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543400578] [2022-04-28 03:16:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:15,474 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:16:15,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 03:16:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:15,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:16:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:15,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:15,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22119#true} is VALID [2022-04-28 03:16:15,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#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(9, 2); {22119#true} is VALID [2022-04-28 03:16:15,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-28 03:16:15,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-28 03:16:15,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-28 03:16:15,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:16:15,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:16:15,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:16:15,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {22146#(and (<= main_~x~0 0) (= main_~y~0 0))} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:16:15,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:16:15,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {22156#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22163#(<= 49 main_~y~0)} is VALID [2022-04-28 03:16:15,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {22163#(<= 49 main_~y~0)} assume ~y~0 < 0; {22120#false} is VALID [2022-04-28 03:16:15,643 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-28 03:16:15,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-28 03:16:15,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-28 03:16:15,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-28 03:16:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:15,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:16,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {22120#false} assume !false; {22120#false} is VALID [2022-04-28 03:16:16,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {22120#false} assume 0 == ~cond; {22120#false} is VALID [2022-04-28 03:16:16,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {22120#false} ~cond := #in~cond; {22120#false} is VALID [2022-04-28 03:16:16,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {22120#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {22120#false} is VALID [2022-04-28 03:16:16,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {22191#(not (< main_~y~0 0))} assume ~y~0 < 0; {22120#false} is VALID [2022-04-28 03:16:16,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {22191#(not (< main_~y~0 0))} is VALID [2022-04-28 03:16:16,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} [194] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:16,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [197] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1062 v_main_~x~0_1061)) (.cse1 (= v_main_~y~0_1157 v_main_~y~0_1156)) (.cse2 (= |v_main_#t~post1_234| |v_main_#t~post1_233|)) (.cse3 (<= 0 (+ v_main_~y~0_1157 1)))) (or (and .cse0 (= |v_main_#t~post3_461| |v_main_#t~post3_457|) .cse1 .cse2) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1062 50))) (= |v_main_#t~post3_457| |v_main_#t~post3_461|) .cse2) (and (= (+ v_main_~x~0_1061 v_main_~y~0_1157) (+ v_main_~x~0_1062 v_main_~y~0_1156)) (< v_main_~x~0_1062 v_main_~x~0_1061) .cse3 (< v_main_~x~0_1061 51)))) InVars {main_~y~0=v_main_~y~0_1157, main_#t~post3=|v_main_#t~post3_461|, main_~x~0=v_main_~x~0_1062, main_#t~post1=|v_main_#t~post1_234|} OutVars{main_~y~0=v_main_~y~0_1156, main_#t~post3=|v_main_#t~post3_457|, main_~x~0=v_main_~x~0_1061, main_#t~post1=|v_main_#t~post1_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {22195#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:16,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [196] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:16,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {22209#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [195] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_458| |v_main_#t~post3_456|)) (.cse1 (= v_main_~y~0_1155 v_main_~y~0_1154)) (.cse3 (= |v_main_#t~post2_259| |v_main_#t~post2_258|)) (.cse2 (<= 50 v_main_~x~0_1060))) (or (and .cse0 .cse1 (= v_main_~x~0_1059 v_main_~x~0_1060) (or (not .cse2) (not (<= 1 v_main_~y~0_1155))) .cse3) (and (= v_main_~x~0_1060 v_main_~x~0_1059) .cse0 .cse1 .cse3) (let ((.cse4 (+ v_main_~x~0_1060 v_main_~y~0_1155))) (and (<= v_main_~x~0_1059 .cse4) (< v_main_~x~0_1060 v_main_~x~0_1059) (= .cse4 (+ v_main_~x~0_1059 v_main_~y~0_1154)) .cse2)))) InVars {main_~y~0=v_main_~y~0_1155, main_#t~post2=|v_main_#t~post2_259|, main_#t~post3=|v_main_#t~post3_458|, main_~x~0=v_main_~x~0_1060} OutVars{main_~y~0=v_main_~y~0_1154, main_#t~post2=|v_main_#t~post2_258|, main_#t~post3=|v_main_#t~post3_456|, main_~x~0=v_main_~x~0_1059} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {22202#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:16,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {22119#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {22209#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:16:16,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {22119#true} call #t~ret4 := main(); {22119#true} is VALID [2022-04-28 03:16:16,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22119#true} {22119#true} #61#return; {22119#true} is VALID [2022-04-28 03:16:16,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {22119#true} assume true; {22119#true} is VALID [2022-04-28 03:16:16,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {22119#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(9, 2); {22119#true} is VALID [2022-04-28 03:16:16,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {22119#true} call ULTIMATE.init(); {22119#true} is VALID [2022-04-28 03:16:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:16,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543400578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:16,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:16,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:16:17,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:17,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042036421] [2022-04-28 03:16:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042036421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:17,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:16:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529020476] [2022-04-28 03:16:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 112 [2022-04-28 03:16:17,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:17,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 03:16:17,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:16:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:16:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=5148, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:16:17,726 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 03:16:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:24,979 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 03:16:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:16:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 112 [2022-04-28 03:16:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 03:16:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2022-04-28 03:16:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 03:16:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2022-04-28 03:16:24,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 124 transitions. [2022-04-28 03:16:25,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:25,092 INFO L225 Difference]: With dead ends: 138 [2022-04-28 03:16:25,092 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 03:16:25,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1220, Invalid=18240, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:16:25,094 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 77 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:25,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 177 Invalid, 5267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:16:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 03:16:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-04-28 03:16:25,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:25,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 03:16:25,435 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 03:16:25,435 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 03:16:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:25,436 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2022-04-28 03:16:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-04-28 03:16:25,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:25,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:25,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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) Second operand 123 states. [2022-04-28 03:16:25,436 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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) Second operand 123 states. [2022-04-28 03:16:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:25,437 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2022-04-28 03:16:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-04-28 03:16:25,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:25,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:25,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:25,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 03:16:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-04-28 03:16:25,439 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 112 [2022-04-28 03:16:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:25,439 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-04-28 03:16:25,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.565217391304348) internal successors, (108), 68 states have internal predecessors, (108), 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 03:16:25,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 126 transitions. [2022-04-28 03:16:25,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-04-28 03:16:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 03:16:25,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:25,571 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:25,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:25,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:16:25,772 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash 376989443, now seen corresponding path program 35 times [2022-04-28 03:16:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:25,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146405034] [2022-04-28 03:16:29,860 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:29,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:30,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:30,116 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1332503861, now seen corresponding path program 1 times [2022-04-28 03:16:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:30,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136629354] [2022-04-28 03:16:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:30,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:30,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {23195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-28 03:16:30,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-28 03:16:30,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23192#(= main_~x~0 0)} is VALID [2022-04-28 03:16:30,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {23192#(= main_~x~0 0)} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23192#(= main_~x~0 0)} is VALID [2022-04-28 03:16:30,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {23192#(= main_~x~0 0)} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23192#(= main_~x~0 0)} is VALID [2022-04-28 03:16:30,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {23192#(= main_~x~0 0)} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:16:30,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:16:30,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {23193#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23194#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} is VALID [2022-04-28 03:16:30,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {23194#(and (<= 48 main_~y~0) (not (= main_~x~0 0)))} assume ~y~0 < 0; {23188#false} is VALID [2022-04-28 03:16:30,165 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-28 03:16:30,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-28 03:16:30,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-28 03:16:30,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-28 03:16:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136629354] [2022-04-28 03:16:30,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136629354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959551664] [2022-04-28 03:16:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:30,167 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:16:30,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 03:16:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:30,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:16:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:30,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:30,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23187#true} is VALID [2022-04-28 03:16:30,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#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(9, 2); {23187#true} is VALID [2022-04-28 03:16:30,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-28 03:16:30,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-28 03:16:30,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-28 03:16:30,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:30,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:30,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:30,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {23214#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:16:30,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:16:30,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {23224#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23231#(<= 49 main_~y~0)} is VALID [2022-04-28 03:16:30,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {23231#(<= 49 main_~y~0)} assume ~y~0 < 0; {23188#false} is VALID [2022-04-28 03:16:30,460 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-28 03:16:30,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-28 03:16:30,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-28 03:16:30,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-28 03:16:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:30,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:30,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {23188#false} assume !false; {23188#false} is VALID [2022-04-28 03:16:30,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {23188#false} assume 0 == ~cond; {23188#false} is VALID [2022-04-28 03:16:30,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {23188#false} ~cond := #in~cond; {23188#false} is VALID [2022-04-28 03:16:30,893 INFO L272 TraceCheckUtils]: 12: Hoare triple {23188#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {23188#false} is VALID [2022-04-28 03:16:30,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {23259#(not (< main_~y~0 0))} assume ~y~0 < 0; {23188#false} is VALID [2022-04-28 03:16:30,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {23259#(not (< main_~y~0 0))} is VALID [2022-04-28 03:16:30,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} [198] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:30,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [201] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_241| |v_main_#t~post1_240|)) (.cse1 (= v_main_~x~0_1111 v_main_~x~0_1110)) (.cse2 (= v_main_~y~0_1209 v_main_~y~0_1208)) (.cse3 (= |v_main_#t~post3_475| |v_main_#t~post3_471|)) (.cse4 (<= 0 (+ v_main_~y~0_1209 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1111 50)))) (and (= (+ v_main_~x~0_1110 v_main_~y~0_1209) (+ v_main_~x~0_1111 v_main_~y~0_1208)) .cse4 (< v_main_~x~0_1110 51) (< v_main_~x~0_1111 v_main_~x~0_1110)))) InVars {main_~y~0=v_main_~y~0_1209, main_#t~post3=|v_main_#t~post3_475|, main_~x~0=v_main_~x~0_1111, main_#t~post1=|v_main_#t~post1_241|} OutVars{main_~y~0=v_main_~y~0_1208, main_#t~post3=|v_main_#t~post3_471|, main_~x~0=v_main_~x~0_1110, main_#t~post1=|v_main_#t~post1_240|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {23263#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:30,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [200] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:30,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {23277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [199] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1109 v_main_~x~0_1108)) (.cse1 (= |v_main_#t~post3_472| |v_main_#t~post3_470|)) (.cse2 (= |v_main_#t~post2_267| |v_main_#t~post2_266|)) (.cse3 (= v_main_~y~0_1207 v_main_~y~0_1206)) (.cse4 (<= 50 v_main_~x~0_1109))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (<= 1 v_main_~y~0_1207))) .cse1 .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_1108 v_main_~y~0_1206) (+ v_main_~x~0_1109 v_main_~y~0_1207)) (< v_main_~y~0_1206 v_main_~y~0_1207) (<= 0 v_main_~y~0_1206)))) InVars {main_~y~0=v_main_~y~0_1207, main_#t~post2=|v_main_#t~post2_267|, main_#t~post3=|v_main_#t~post3_472|, main_~x~0=v_main_~x~0_1109} OutVars{main_~y~0=v_main_~y~0_1206, main_#t~post2=|v_main_#t~post2_266|, main_#t~post3=|v_main_#t~post3_470|, main_~x~0=v_main_~x~0_1108} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {23270#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:30,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {23187#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {23277#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:16:30,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {23187#true} call #t~ret4 := main(); {23187#true} is VALID [2022-04-28 03:16:30,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23187#true} {23187#true} #61#return; {23187#true} is VALID [2022-04-28 03:16:30,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {23187#true} assume true; {23187#true} is VALID [2022-04-28 03:16:30,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {23187#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(9, 2); {23187#true} is VALID [2022-04-28 03:16:30,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {23187#true} call ULTIMATE.init(); {23187#true} is VALID [2022-04-28 03:16:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959551664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:30,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:16:32,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:32,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146405034] [2022-04-28 03:16:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146405034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:32,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:32,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-28 03:16:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402813635] [2022-04-28 03:16:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 115 [2022-04-28 03:16:32,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:32,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 03:16:32,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:32,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-28 03:16:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-28 03:16:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 03:16:32,959 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 03:16:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:38,910 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-04-28 03:16:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:16:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 115 [2022-04-28 03:16:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 03:16:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 127 transitions. [2022-04-28 03:16:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 03:16:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 127 transitions. [2022-04-28 03:16:38,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 127 transitions. [2022-04-28 03:16:38,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:38,978 INFO L225 Difference]: With dead ends: 141 [2022-04-28 03:16:38,978 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 03:16:38,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5826 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1256, Invalid=19336, Unknown=0, NotChecked=0, Total=20592 [2022-04-28 03:16:38,980 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4918 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 4918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:38,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 68 Invalid, 5085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 4918 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:16:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 03:16:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-04-28 03:16:39,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:39,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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 03:16:39,293 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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 03:16:39,293 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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 03:16:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:39,295 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-28 03:16:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:16:39,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:39,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:39,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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) Second operand 126 states. [2022-04-28 03:16:39,295 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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) Second operand 126 states. [2022-04-28 03:16:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:39,297 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-28 03:16:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:16:39,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:39,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:39,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:39,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0416666666666667) internal successors, (125), 120 states have internal predecessors, (125), 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 03:16:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-04-28 03:16:39,299 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 115 [2022-04-28 03:16:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:39,299 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-04-28 03:16:39,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 70 states have internal predecessors, (111), 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 03:16:39,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 129 transitions. [2022-04-28 03:16:39,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-04-28 03:16:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 03:16:39,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:39,437 INFO L195 NwaCegarLoop]: trace histogram [36, 35, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:39,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 03:16:39,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:16:39,660 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2139319463, now seen corresponding path program 36 times [2022-04-28 03:16:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123613500] [2022-04-28 03:16:43,752 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:43,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:47,964 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:16:48,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:48,062 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1172880331, now seen corresponding path program 1 times [2022-04-28 03:16:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800357648] [2022-04-28 03:16:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:48,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:48,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {24287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-28 03:16:48,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-28 03:16:48,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24284#(= main_~x~0 0)} is VALID [2022-04-28 03:16:48,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {24284#(= main_~x~0 0)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24284#(= main_~x~0 0)} is VALID [2022-04-28 03:16:48,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {24284#(= main_~x~0 0)} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24284#(= main_~x~0 0)} is VALID [2022-04-28 03:16:48,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {24284#(= main_~x~0 0)} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:48,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:48,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {24285#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24286#(<= 48 main_~y~0)} is VALID [2022-04-28 03:16:48,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {24286#(<= 48 main_~y~0)} assume ~y~0 < 0; {24280#false} is VALID [2022-04-28 03:16:48,111 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-28 03:16:48,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-28 03:16:48,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-28 03:16:48,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-28 03:16:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:48,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:48,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800357648] [2022-04-28 03:16:48,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800357648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:48,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709905174] [2022-04-28 03:16:48,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:48,113 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:16:48,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 03:16:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:48,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:16:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:48,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24279#true} is VALID [2022-04-28 03:16:48,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#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(9, 2); {24279#true} is VALID [2022-04-28 03:16:48,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-28 03:16:48,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-28 03:16:48,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-28 03:16:48,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24306#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:48,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {24306#(<= main_~x~0 0)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24306#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:48,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {24306#(<= main_~x~0 0)} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24306#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:48,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {24306#(<= main_~x~0 0)} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:16:48,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:16:48,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {24316#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24286#(<= 48 main_~y~0)} is VALID [2022-04-28 03:16:48,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {24286#(<= 48 main_~y~0)} assume ~y~0 < 0; {24280#false} is VALID [2022-04-28 03:16:48,330 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-28 03:16:48,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-28 03:16:48,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-28 03:16:48,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-28 03:16:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:48,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:48,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {24280#false} assume !false; {24280#false} is VALID [2022-04-28 03:16:48,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {24280#false} assume 0 == ~cond; {24280#false} is VALID [2022-04-28 03:16:48,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {24280#false} ~cond := #in~cond; {24280#false} is VALID [2022-04-28 03:16:48,674 INFO L272 TraceCheckUtils]: 12: Hoare triple {24280#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {24280#false} is VALID [2022-04-28 03:16:48,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {24350#(not (< main_~y~0 0))} assume ~y~0 < 0; {24280#false} is VALID [2022-04-28 03:16:48,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {24350#(not (< main_~y~0 0))} is VALID [2022-04-28 03:16:48,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} [202] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:48,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [205] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1262 1))) (.cse2 (= v_main_~y~0_1262 v_main_~y~0_1261)) (.cse3 (= v_main_~x~0_1161 v_main_~x~0_1160)) (.cse4 (= |v_main_#t~post3_489| |v_main_#t~post3_485|)) (.cse5 (= |v_main_#t~post1_248| |v_main_#t~post1_247|))) (or (let ((.cse0 (+ v_main_~x~0_1161 v_main_~y~0_1261))) (and (< v_main_~y~0_1262 v_main_~y~0_1261) (= .cse0 (+ v_main_~x~0_1160 v_main_~y~0_1262)) (< .cse0 (+ 51 v_main_~y~0_1262)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_1161 50)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1262, main_#t~post3=|v_main_#t~post3_489|, main_~x~0=v_main_~x~0_1161, main_#t~post1=|v_main_#t~post1_248|} OutVars{main_~y~0=v_main_~y~0_1261, main_#t~post3=|v_main_#t~post3_485|, main_~x~0=v_main_~x~0_1160, main_#t~post1=|v_main_#t~post1_247|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {24354#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:48,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [204] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:48,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {24368#(<= main_~x~0 48)} [203] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_275| |v_main_#t~post2_274|)) (.cse5 (<= 50 v_main_~x~0_1159)) (.cse1 (= |v_main_#t~post3_486| |v_main_#t~post3_484|)) (.cse2 (= v_main_~x~0_1159 v_main_~x~0_1158)) (.cse3 (= v_main_~y~0_1260 v_main_~y~0_1259))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1159 v_main_~y~0_1260))) (and (< v_main_~x~0_1159 v_main_~x~0_1158) (<= v_main_~x~0_1158 .cse4) (= .cse4 (+ v_main_~x~0_1158 v_main_~y~0_1259)) .cse5)) (and .cse0 (or (not (<= 1 v_main_~y~0_1260)) (not .cse5)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1260, main_#t~post2=|v_main_#t~post2_275|, main_#t~post3=|v_main_#t~post3_486|, main_~x~0=v_main_~x~0_1159} OutVars{main_~y~0=v_main_~y~0_1259, main_#t~post2=|v_main_#t~post2_274|, main_#t~post3=|v_main_#t~post3_484|, main_~x~0=v_main_~x~0_1158} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {24361#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:16:48,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {24279#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {24368#(<= main_~x~0 48)} is VALID [2022-04-28 03:16:48,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {24279#true} call #t~ret4 := main(); {24279#true} is VALID [2022-04-28 03:16:48,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24279#true} {24279#true} #61#return; {24279#true} is VALID [2022-04-28 03:16:48,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {24279#true} assume true; {24279#true} is VALID [2022-04-28 03:16:48,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {24279#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(9, 2); {24279#true} is VALID [2022-04-28 03:16:48,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {24279#true} call ULTIMATE.init(); {24279#true} is VALID [2022-04-28 03:16:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709905174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:48,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:48,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:16:50,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123613500] [2022-04-28 03:16:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123613500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-28 03:16:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843059464] [2022-04-28 03:16:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 118 [2022-04-28 03:16:50,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:50,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 03:16:50,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-28 03:16:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-28 03:16:50,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5550, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 03:16:50,309 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 03:16:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,213 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2022-04-28 03:16:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-28 03:16:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 118 [2022-04-28 03:16:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 03:16:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-28 03:16:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 03:16:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-28 03:16:56,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-28 03:16:56,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:56,337 INFO L225 Difference]: With dead ends: 144 [2022-04-28 03:16:56,337 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 03:16:56,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6169 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1358, Invalid=20104, Unknown=0, NotChecked=0, Total=21462 [2022-04-28 03:16:56,338 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:56,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 119 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:16:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 03:16:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-04-28 03:16:56,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:56,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 03:16:56,771 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 03:16:56,771 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 03:16:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,772 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-28 03:16:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-28 03:16:56,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:56,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:56,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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) Second operand 129 states. [2022-04-28 03:16:56,772 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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) Second operand 129 states. [2022-04-28 03:16:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,773 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-28 03:16:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-28 03:16:56,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:56,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:56,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:56,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 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 03:16:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-28 03:16:56,775 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 118 [2022-04-28 03:16:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:56,775 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-28 03:16:56,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 72 states have internal predecessors, (114), 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 03:16:56,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-28 03:16:56,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:16:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-28 03:16:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 03:16:56,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:56,929 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:16:56,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 03:16:57,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 03:16:57,144 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2032718979, now seen corresponding path program 37 times [2022-04-28 03:16:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:57,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004196403] [2022-04-28 03:16:57,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:57,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:16:57,541 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:16:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash -616702773, now seen corresponding path program 1 times [2022-04-28 03:16:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:57,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603758449] [2022-04-28 03:16:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-28 03:16:57,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-28 03:16:57,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-28 03:16:57,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:16:57,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {25403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25394#true} is VALID [2022-04-28 03:16:57,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-28 03:16:57,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-28 03:16:57,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-28 03:16:57,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25399#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:16:57,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {25399#(and (= main_~x~0 0) (= main_~y~0 0))} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:57,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:16:57,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {25400#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:57,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:57,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25402#(<= 0 main_~y~0)} is VALID [2022-04-28 03:16:57,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {25402#(<= 0 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-28 03:16:57,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-28 03:16:57,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-28 03:16:57,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-28 03:16:57,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-28 03:16:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603758449] [2022-04-28 03:16:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603758449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892264189] [2022-04-28 03:16:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:57,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:57,582 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:16:57,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 03:16:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:16:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:57,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25394#true} is VALID [2022-04-28 03:16:57,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#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(9, 2); {25394#true} is VALID [2022-04-28 03:16:57,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-28 03:16:57,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-28 03:16:57,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-28 03:16:57,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25422#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:57,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {25422#(<= main_~x~0 0)} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25422#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:57,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {25422#(<= main_~x~0 0)} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25422#(<= main_~x~0 0)} is VALID [2022-04-28 03:16:57,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {25422#(<= main_~x~0 0)} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:16:57,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:16:57,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {25432#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25439#(<= 48 main_~y~0)} is VALID [2022-04-28 03:16:57,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {25439#(<= 48 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-28 03:16:57,795 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-28 03:16:57,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-28 03:16:57,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-28 03:16:57,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-28 03:16:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:16:57,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:58,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {25395#false} assume !false; {25395#false} is VALID [2022-04-28 03:16:58,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {25395#false} assume 0 == ~cond; {25395#false} is VALID [2022-04-28 03:16:58,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {25395#false} ~cond := #in~cond; {25395#false} is VALID [2022-04-28 03:16:58,306 INFO L272 TraceCheckUtils]: 12: Hoare triple {25395#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {25395#false} is VALID [2022-04-28 03:16:58,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {25402#(<= 0 main_~y~0)} assume ~y~0 < 0; {25395#false} is VALID [2022-04-28 03:16:58,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {25402#(<= 0 main_~y~0)} is VALID [2022-04-28 03:16:58,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [206] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:58,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [209] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 0 (+ v_main_~y~0_1316 1))) (.cse2 (= v_main_~y~0_1316 v_main_~y~0_1315)) (.cse3 (= |v_main_#t~post1_255| |v_main_#t~post1_254|)) (.cse4 (= v_main_~x~0_1212 v_main_~x~0_1211)) (.cse5 (= |v_main_#t~post3_503| |v_main_#t~post3_499|))) (or (let ((.cse0 (+ v_main_~x~0_1212 v_main_~y~0_1315))) (and (= (+ v_main_~x~0_1211 v_main_~y~0_1316) .cse0) .cse1 (< v_main_~y~0_1316 v_main_~y~0_1315) (< .cse0 (+ 51 v_main_~y~0_1316)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_1212 50))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1316, main_#t~post3=|v_main_#t~post3_503|, main_~x~0=v_main_~x~0_1212, main_#t~post1=|v_main_#t~post1_255|} OutVars{main_~y~0=v_main_~y~0_1315, main_#t~post3=|v_main_#t~post3_499|, main_~x~0=v_main_~x~0_1211, main_#t~post1=|v_main_#t~post1_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {25401#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:16:58,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [208] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-28 03:16:58,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {25483#(<= main_~x~0 48)} [207] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~y~0_1314 v_main_~y~0_1313)) (.cse1 (<= 50 v_main_~x~0_1210)) (.cse3 (= |v_main_#t~post3_500| |v_main_#t~post3_498|))) (or (let ((.cse0 (+ v_main_~x~0_1210 v_main_~y~0_1314))) (and (<= v_main_~x~0_1209 .cse0) (= (+ v_main_~x~0_1209 v_main_~y~0_1313) .cse0) .cse1 (< v_main_~x~0_1210 v_main_~x~0_1209))) (and .cse2 (= |v_main_#t~post2_283| |v_main_#t~post2_282|) (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3) (and (= |v_main_#t~post2_282| |v_main_#t~post2_283|) .cse2 (or (not .cse1) (not (<= 1 v_main_~y~0_1314))) (= v_main_~x~0_1209 v_main_~x~0_1210) .cse3))) InVars {main_~y~0=v_main_~y~0_1314, main_#t~post2=|v_main_#t~post2_283|, main_#t~post3=|v_main_#t~post3_500|, main_~x~0=v_main_~x~0_1210} OutVars{main_~y~0=v_main_~y~0_1313, main_#t~post2=|v_main_#t~post2_282|, main_#t~post3=|v_main_#t~post3_498|, main_~x~0=v_main_~x~0_1209} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {25476#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-28 03:16:58,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {25394#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {25483#(<= main_~x~0 48)} is VALID [2022-04-28 03:16:58,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {25394#true} call #t~ret4 := main(); {25394#true} is VALID [2022-04-28 03:16:58,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25394#true} {25394#true} #61#return; {25394#true} is VALID [2022-04-28 03:16:58,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {25394#true} assume true; {25394#true} is VALID [2022-04-28 03:16:58,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {25394#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(9, 2); {25394#true} is VALID [2022-04-28 03:16:58,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {25394#true} call ULTIMATE.init(); {25394#true} is VALID [2022-04-28 03:16:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:16:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892264189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:58,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-28 03:17:00,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004196403] [2022-04-28 03:17:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004196403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:00,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:00,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-28 03:17:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298201454] [2022-04-28 03:17:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:00,865 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 121 [2022-04-28 03:17:00,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:00,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 03:17:00,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:00,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-28 03:17:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-28 03:17:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=6104, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:17:00,947 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 03:17:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:10,757 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-04-28 03:17:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-28 03:17:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 121 [2022-04-28 03:17:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 03:17:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2022-04-28 03:17:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 03:17:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2022-04-28 03:17:10,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 133 transitions. [2022-04-28 03:17:10,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:10,837 INFO L225 Difference]: With dead ends: 146 [2022-04-28 03:17:10,837 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 03:17:10,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1334, Invalid=22536, Unknown=0, NotChecked=0, Total=23870 [2022-04-28 03:17:10,838 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7654 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 7654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:10,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 64 Invalid, 7878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 7654 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 03:17:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 03:17:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 03:17:11,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:11,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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 03:17:11,173 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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 03:17:11,173 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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 03:17:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:11,174 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-28 03:17:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:17:11,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:11,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:11,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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) Second operand 131 states. [2022-04-28 03:17:11,174 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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) Second operand 131 states. [2022-04-28 03:17:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:11,175 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-28 03:17:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:17:11,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:11,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:11,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:11,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0396825396825398) internal successors, (131), 126 states have internal predecessors, (131), 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 03:17:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-04-28 03:17:11,177 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 121 [2022-04-28 03:17:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:11,177 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-04-28 03:17:11,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 75 states have internal predecessors, (117), 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 03:17:11,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 135 transitions. [2022-04-28 03:17:11,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:17:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 03:17:11,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:11,353 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:11,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:17:11,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 03:17:11,563 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 278531879, now seen corresponding path program 38 times [2022-04-28 03:17:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:11,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236433600] [2022-04-28 03:17:11,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:12,038 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:12,039 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1888681419, now seen corresponding path program 1 times [2022-04-28 03:17:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:12,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054162328] [2022-04-28 03:17:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:12,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-28 03:17:12,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-28 03:17:12,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-28 03:17:12,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:12,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {26544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26536#true} is VALID [2022-04-28 03:17:12,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-28 03:17:12,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-28 03:17:12,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-28 03:17:12,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26541#(= main_~x~0 0)} is VALID [2022-04-28 03:17:12,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {26541#(= main_~x~0 0)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26541#(= main_~x~0 0)} is VALID [2022-04-28 03:17:12,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {26541#(= main_~x~0 0)} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26541#(= main_~x~0 0)} is VALID [2022-04-28 03:17:12,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {26541#(= main_~x~0 0)} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:12,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:12,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {26542#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26543#(<= 48 main_~y~0)} is VALID [2022-04-28 03:17:12,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {26543#(<= 48 main_~y~0)} assume ~y~0 < 0; {26537#false} is VALID [2022-04-28 03:17:12,104 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-28 03:17:12,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-28 03:17:12,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-28 03:17:12,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-28 03:17:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054162328] [2022-04-28 03:17:12,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054162328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631915330] [2022-04-28 03:17:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:12,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:12,116 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:17:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:12,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:17:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:12,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:12,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 03:17:12,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26536#true} is VALID [2022-04-28 03:17:12,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#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(9, 2); {26536#true} is VALID [2022-04-28 03:17:12,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-28 03:17:12,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-28 03:17:12,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-28 03:17:12,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26563#(<= main_~x~0 0)} is VALID [2022-04-28 03:17:12,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {26563#(<= main_~x~0 0)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26563#(<= main_~x~0 0)} is VALID [2022-04-28 03:17:12,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {26563#(<= main_~x~0 0)} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26563#(<= main_~x~0 0)} is VALID [2022-04-28 03:17:12,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {26563#(<= main_~x~0 0)} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:17:12,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:17:12,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {26573#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26543#(<= 48 main_~y~0)} is VALID [2022-04-28 03:17:12,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {26543#(<= 48 main_~y~0)} assume ~y~0 < 0; {26537#false} is VALID [2022-04-28 03:17:12,376 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-28 03:17:12,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-28 03:17:12,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-28 03:17:12,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-28 03:17:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:12,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:12,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {26537#false} assume !false; {26537#false} is VALID [2022-04-28 03:17:12,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {26537#false} assume 0 == ~cond; {26537#false} is VALID [2022-04-28 03:17:12,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {26537#false} ~cond := #in~cond; {26537#false} is VALID [2022-04-28 03:17:12,778 INFO L272 TraceCheckUtils]: 12: Hoare triple {26537#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {26537#false} is VALID [2022-04-28 03:17:12,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {26607#(not (< main_~y~0 0))} assume ~y~0 < 0; {26537#false} is VALID [2022-04-28 03:17:12,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {26607#(not (< main_~y~0 0))} is VALID [2022-04-28 03:17:12,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} [210] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:12,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [213] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1371 1))) (.cse0 (= v_main_~y~0_1371 v_main_~y~0_1370)) (.cse1 (= v_main_~x~0_1264 v_main_~x~0_1263)) (.cse3 (= |v_main_#t~post3_517| |v_main_#t~post3_513|))) (or (and .cse0 .cse1 (= |v_main_#t~post1_261| |v_main_#t~post1_262|) (or (not (< v_main_~x~0_1264 50)) (not .cse2)) .cse3) (and .cse2 (< v_main_~x~0_1263 51) (< v_main_~x~0_1264 v_main_~x~0_1263) (= (+ v_main_~x~0_1264 v_main_~y~0_1370) (+ v_main_~x~0_1263 v_main_~y~0_1371))) (and .cse0 .cse1 (= |v_main_#t~post1_262| |v_main_#t~post1_261|) .cse3))) InVars {main_~y~0=v_main_~y~0_1371, main_#t~post3=|v_main_#t~post3_517|, main_~x~0=v_main_~x~0_1264, main_#t~post1=|v_main_#t~post1_262|} OutVars{main_~y~0=v_main_~y~0_1370, main_#t~post3=|v_main_#t~post3_513|, main_~x~0=v_main_~x~0_1263, main_#t~post1=|v_main_#t~post1_261|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {26611#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:12,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [212] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:12,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {26625#(<= main_~x~0 48)} [211] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1262 v_main_~x~0_1261)) (.cse1 (= v_main_~y~0_1369 v_main_~y~0_1368)) (.cse2 (= |v_main_#t~post3_514| |v_main_#t~post3_512|)) (.cse4 (<= 50 v_main_~x~0_1262)) (.cse3 (= |v_main_#t~post2_291| |v_main_#t~post2_290|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1262 v_main_~y~0_1369))) (and .cse4 (= .cse5 (+ v_main_~x~0_1261 v_main_~y~0_1368)) (< v_main_~x~0_1262 v_main_~x~0_1261) (<= v_main_~x~0_1261 .cse5))) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1369)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_1369, main_#t~post2=|v_main_#t~post2_291|, main_#t~post3=|v_main_#t~post3_514|, main_~x~0=v_main_~x~0_1262} OutVars{main_~y~0=v_main_~y~0_1368, main_#t~post2=|v_main_#t~post2_290|, main_#t~post3=|v_main_#t~post3_512|, main_~x~0=v_main_~x~0_1261} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {26618#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:12,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {26536#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {26625#(<= main_~x~0 48)} is VALID [2022-04-28 03:17:12,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {26536#true} call #t~ret4 := main(); {26536#true} is VALID [2022-04-28 03:17:12,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26536#true} {26536#true} #61#return; {26536#true} is VALID [2022-04-28 03:17:12,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {26536#true} assume true; {26536#true} is VALID [2022-04-28 03:17:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {26536#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(9, 2); {26536#true} is VALID [2022-04-28 03:17:12,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {26536#true} call ULTIMATE.init(); {26536#true} is VALID [2022-04-28 03:17:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:12,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631915330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:12,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:12,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:17:14,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:14,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236433600] [2022-04-28 03:17:14,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236433600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:14,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:14,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-28 03:17:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662716423] [2022-04-28 03:17:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 124 [2022-04-28 03:17:14,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:14,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 03:17:14,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:14,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-28 03:17:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-28 03:17:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=6160, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:17:14,314 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 03:17:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:21,939 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-28 03:17:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-28 03:17:21,939 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 124 [2022-04-28 03:17:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 03:17:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2022-04-28 03:17:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 03:17:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2022-04-28 03:17:21,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 136 transitions. [2022-04-28 03:17:22,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:22,014 INFO L225 Difference]: With dead ends: 150 [2022-04-28 03:17:22,014 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 03:17:22,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6891 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1436, Invalid=22434, Unknown=0, NotChecked=0, Total=23870 [2022-04-28 03:17:22,015 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 85 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 6757 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 6912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 6757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:22,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 296 Invalid, 6912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 6757 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 03:17:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 03:17:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2022-04-28 03:17:22,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:22,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 03:17:22,317 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 03:17:22,317 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 03:17:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:22,319 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-04-28 03:17:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2022-04-28 03:17:22,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:22,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:22,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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) Second operand 135 states. [2022-04-28 03:17:22,319 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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) Second operand 135 states. [2022-04-28 03:17:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:22,320 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-04-28 03:17:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2022-04-28 03:17:22,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:22,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:22,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:22,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 03:17:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-28 03:17:22,322 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 124 [2022-04-28 03:17:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:22,322 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-28 03:17:22,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 76 states have internal predecessors, (120), 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 03:17:22,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-28 03:17:22,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-28 03:17:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 03:17:22,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:22,487 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:22,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:17:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:22,688 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1842273789, now seen corresponding path program 39 times [2022-04-28 03:17:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:22,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75479331] [2022-04-28 03:17:26,817 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:26,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:27,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:27,145 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash 99098315, now seen corresponding path program 1 times [2022-04-28 03:17:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194144088] [2022-04-28 03:17:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:27,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-28 03:17:27,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-28 03:17:27,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-28 03:17:27,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:27,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {27707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27699#true} is VALID [2022-04-28 03:17:27,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-28 03:17:27,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-28 03:17:27,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-28 03:17:27,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27704#(= main_~x~0 0)} is VALID [2022-04-28 03:17:27,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {27704#(= main_~x~0 0)} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27704#(= main_~x~0 0)} is VALID [2022-04-28 03:17:27,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {27704#(= main_~x~0 0)} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27704#(= main_~x~0 0)} is VALID [2022-04-28 03:17:27,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {27704#(= main_~x~0 0)} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {27705#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27706#(<= 48 main_~y~0)} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {27706#(<= 48 main_~y~0)} assume ~y~0 < 0; {27700#false} is VALID [2022-04-28 03:17:27,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-28 03:17:27,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-28 03:17:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:27,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:27,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194144088] [2022-04-28 03:17:27,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194144088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:27,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944221001] [2022-04-28 03:17:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:27,201 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:17:27,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 03:17:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:27,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:17:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:27,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:27,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27699#true} is VALID [2022-04-28 03:17:27,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#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(9, 2); {27699#true} is VALID [2022-04-28 03:17:27,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-28 03:17:27,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-28 03:17:27,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-28 03:17:27,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:27,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:27,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:27,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {27726#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:17:27,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:17:27,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {27736#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27743#(<= 49 main_~y~0)} is VALID [2022-04-28 03:17:27,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {27743#(<= 49 main_~y~0)} assume ~y~0 < 0; {27700#false} is VALID [2022-04-28 03:17:27,401 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-28 03:17:27,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-28 03:17:27,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-28 03:17:27,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-28 03:17:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:27,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:27,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {27700#false} assume !false; {27700#false} is VALID [2022-04-28 03:17:27,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {27700#false} assume 0 == ~cond; {27700#false} is VALID [2022-04-28 03:17:27,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {27700#false} ~cond := #in~cond; {27700#false} is VALID [2022-04-28 03:17:27,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {27700#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {27700#false} is VALID [2022-04-28 03:17:27,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {27771#(not (< main_~y~0 0))} assume ~y~0 < 0; {27700#false} is VALID [2022-04-28 03:17:27,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {27771#(not (< main_~y~0 0))} is VALID [2022-04-28 03:17:27,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} [214] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:27,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [217] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse1 (= |v_main_#t~post3_531| |v_main_#t~post3_527|)) (.cse2 (= |v_main_#t~post1_269| |v_main_#t~post1_268|)) (.cse3 (= v_main_~x~0_1317 v_main_~x~0_1316)) (.cse4 (<= 0 (+ v_main_~y~0_1427 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1317 50))) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1317 v_main_~y~0_1426))) (and (< v_main_~y~0_1427 v_main_~y~0_1426) (< .cse5 (+ 51 v_main_~y~0_1427)) (= (+ v_main_~x~0_1316 v_main_~y~0_1427) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post3=|v_main_#t~post3_531|, main_~x~0=v_main_~x~0_1317, main_#t~post1=|v_main_#t~post1_269|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post3=|v_main_#t~post3_527|, main_~x~0=v_main_~x~0_1316, main_#t~post1=|v_main_#t~post1_268|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {27775#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:27,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [216] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:27,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {27789#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [215] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 50 v_main_~x~0_1315)) (.cse0 (= v_main_~y~0_1425 v_main_~y~0_1424)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_526|)) (.cse2 (= v_main_~x~0_1315 v_main_~x~0_1314)) (.cse4 (= |v_main_#t~post2_299| |v_main_#t~post2_298|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (<= 1 v_main_~y~0_1425))) .cse4) (and (<= 0 v_main_~y~0_1424) (< v_main_~y~0_1424 v_main_~y~0_1425) (= (+ v_main_~x~0_1314 v_main_~y~0_1424) (+ v_main_~x~0_1315 v_main_~y~0_1425)) .cse3) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1425, main_#t~post2=|v_main_#t~post2_299|, main_#t~post3=|v_main_#t~post3_528|, main_~x~0=v_main_~x~0_1315} OutVars{main_~y~0=v_main_~y~0_1424, main_#t~post2=|v_main_#t~post2_298|, main_#t~post3=|v_main_#t~post3_526|, main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {27782#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:27,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {27699#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {27789#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:17:27,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {27699#true} call #t~ret4 := main(); {27699#true} is VALID [2022-04-28 03:17:27,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27699#true} {27699#true} #61#return; {27699#true} is VALID [2022-04-28 03:17:27,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {27699#true} assume true; {27699#true} is VALID [2022-04-28 03:17:27,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {27699#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(9, 2); {27699#true} is VALID [2022-04-28 03:17:27,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {27699#true} call ULTIMATE.init(); {27699#true} is VALID [2022-04-28 03:17:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944221001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:27,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:27,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:17:29,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75479331] [2022-04-28 03:17:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75479331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:29,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:29,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-28 03:17:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439821512] [2022-04-28 03:17:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 127 [2022-04-28 03:17:29,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:29,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 03:17:29,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:29,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-28 03:17:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:29,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-28 03:17:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=6678, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:17:29,840 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 03:17:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:37,679 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2022-04-28 03:17:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-28 03:17:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 127 [2022-04-28 03:17:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 03:17:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 139 transitions. [2022-04-28 03:17:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 03:17:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 139 transitions. [2022-04-28 03:17:37,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 139 transitions. [2022-04-28 03:17:37,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:37,748 INFO L225 Difference]: With dead ends: 153 [2022-04-28 03:17:37,748 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 03:17:37,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7424 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1405, Invalid=24035, Unknown=0, NotChecked=0, Total=25440 [2022-04-28 03:17:37,749 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6884 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 6884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:37,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 102 Invalid, 7070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 6884 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 03:17:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 03:17:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-04-28 03:17:38,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:38,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 03:17:38,048 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 03:17:38,049 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 03:17:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:38,050 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-04-28 03:17:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-28 03:17:38,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:38,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:38,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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) Second operand 138 states. [2022-04-28 03:17:38,050 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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) Second operand 138 states. [2022-04-28 03:17:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:38,051 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-04-28 03:17:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-28 03:17:38,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:38,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:38,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:38,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 03:17:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2022-04-28 03:17:38,053 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 127 [2022-04-28 03:17:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:38,053 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2022-04-28 03:17:38,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 78 states have internal predecessors, (123), 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 03:17:38,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 141 transitions. [2022-04-28 03:17:38,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2022-04-28 03:17:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 03:17:38,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:38,186 INFO L195 NwaCegarLoop]: trace histogram [40, 39, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:38,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 03:17:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 03:17:38,402 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 499962279, now seen corresponding path program 40 times [2022-04-28 03:17:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:38,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303633429] [2022-04-28 03:17:42,488 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:42,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:45,449 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:17:45,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:17:45,550 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:17:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1690484789, now seen corresponding path program 1 times [2022-04-28 03:17:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:45,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383018379] [2022-04-28 03:17:45,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:45,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:45,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-28 03:17:45,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-28 03:17:45,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-28 03:17:45,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:17:45,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {28895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28887#true} is VALID [2022-04-28 03:17:45,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-28 03:17:45,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-28 03:17:45,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-28 03:17:45,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28892#(= main_~x~0 0)} is VALID [2022-04-28 03:17:45,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {28892#(= main_~x~0 0)} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28892#(= main_~x~0 0)} is VALID [2022-04-28 03:17:45,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {28892#(= main_~x~0 0)} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28892#(= main_~x~0 0)} is VALID [2022-04-28 03:17:45,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {28892#(= main_~x~0 0)} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:45,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:45,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {28893#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28894#(<= 48 main_~y~0)} is VALID [2022-04-28 03:17:45,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {28894#(<= 48 main_~y~0)} assume ~y~0 < 0; {28888#false} is VALID [2022-04-28 03:17:45,592 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-28 03:17:45,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-28 03:17:45,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-28 03:17:45,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-28 03:17:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:45,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383018379] [2022-04-28 03:17:45,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383018379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:45,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630246492] [2022-04-28 03:17:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:45,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:45,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:45,593 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:17:45,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 03:17:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:45,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:17:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:45,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:45,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28887#true} is VALID [2022-04-28 03:17:45,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#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(9, 2); {28887#true} is VALID [2022-04-28 03:17:45,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-28 03:17:45,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-28 03:17:45,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-28 03:17:45,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:45,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:45,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:17:45,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {28914#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:17:45,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:17:45,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {28924#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28931#(<= 49 main_~y~0)} is VALID [2022-04-28 03:17:45,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {28931#(<= 49 main_~y~0)} assume ~y~0 < 0; {28888#false} is VALID [2022-04-28 03:17:45,883 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-28 03:17:45,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-28 03:17:45,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-28 03:17:45,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-28 03:17:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:17:45,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:46,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#false} assume !false; {28888#false} is VALID [2022-04-28 03:17:46,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#false} assume 0 == ~cond; {28888#false} is VALID [2022-04-28 03:17:46,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#false} ~cond := #in~cond; {28888#false} is VALID [2022-04-28 03:17:46,347 INFO L272 TraceCheckUtils]: 12: Hoare triple {28888#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {28888#false} is VALID [2022-04-28 03:17:46,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {28959#(not (< main_~y~0 0))} assume ~y~0 < 0; {28888#false} is VALID [2022-04-28 03:17:46,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {28959#(not (< main_~y~0 0))} is VALID [2022-04-28 03:17:46,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} [218] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:46,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [221] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1484 v_main_~y~0_1483)) (.cse2 (= |v_main_#t~post1_276| |v_main_#t~post1_275|)) (.cse3 (= |v_main_#t~post3_545| |v_main_#t~post3_541|)) (.cse0 (<= 0 (+ v_main_~y~0_1484 1))) (.cse4 (= v_main_~x~0_1371 v_main_~x~0_1370))) (or (and (< v_main_~x~0_1371 v_main_~x~0_1370) .cse0 (< v_main_~x~0_1370 51) (= (+ v_main_~x~0_1371 v_main_~y~0_1483) (+ v_main_~x~0_1370 v_main_~y~0_1484))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1371 50))) .cse4))) InVars {main_~y~0=v_main_~y~0_1484, main_#t~post3=|v_main_#t~post3_545|, main_~x~0=v_main_~x~0_1371, main_#t~post1=|v_main_#t~post1_276|} OutVars{main_~y~0=v_main_~y~0_1483, main_#t~post3=|v_main_#t~post3_541|, main_~x~0=v_main_~x~0_1370, main_#t~post1=|v_main_#t~post1_275|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {28963#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:17:46,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [220] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:46,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {28977#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [219] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1482 v_main_~y~0_1481)) (.cse2 (= |v_main_#t~post2_307| |v_main_#t~post2_306|)) (.cse3 (= |v_main_#t~post3_542| |v_main_#t~post3_540|)) (.cse4 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse0 (<= 50 v_main_~x~0_1369))) (or (and (or (not (<= 1 v_main_~y~0_1482)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1369 v_main_~y~0_1482))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) (= .cse5 (+ v_main_~x~0_1368 v_main_~y~0_1481)) .cse0 (<= v_main_~x~0_1368 .cse5))))) InVars {main_~y~0=v_main_~y~0_1482, main_#t~post2=|v_main_#t~post2_307|, main_#t~post3=|v_main_#t~post3_542|, main_~x~0=v_main_~x~0_1369} OutVars{main_~y~0=v_main_~y~0_1481, main_#t~post2=|v_main_#t~post2_306|, main_#t~post3=|v_main_#t~post3_540|, main_~x~0=v_main_~x~0_1368} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {28970#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:17:46,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {28887#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {28977#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:17:46,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {28887#true} call #t~ret4 := main(); {28887#true} is VALID [2022-04-28 03:17:46,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28887#true} {28887#true} #61#return; {28887#true} is VALID [2022-04-28 03:17:46,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {28887#true} assume true; {28887#true} is VALID [2022-04-28 03:17:46,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {28887#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(9, 2); {28887#true} is VALID [2022-04-28 03:17:46,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {28887#true} call ULTIMATE.init(); {28887#true} is VALID [2022-04-28 03:17:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:46,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630246492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:46,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:46,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:17:48,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:48,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303633429] [2022-04-28 03:17:48,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303633429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:48,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:48,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-04-28 03:17:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335942486] [2022-04-28 03:17:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 130 [2022-04-28 03:17:48,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:48,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 03:17:48,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-04-28 03:17:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-04-28 03:17:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=7008, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:17:48,443 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 03:17:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:57,512 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2022-04-28 03:17:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-28 03:17:57,512 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 130 [2022-04-28 03:17:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 03:17:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 142 transitions. [2022-04-28 03:17:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 03:17:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 142 transitions. [2022-04-28 03:17:57,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 142 transitions. [2022-04-28 03:17:57,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:57,588 INFO L225 Difference]: With dead ends: 156 [2022-04-28 03:17:57,588 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 03:17:57,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7814 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1442, Invalid=25290, Unknown=0, NotChecked=0, Total=26732 [2022-04-28 03:17:57,594 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7383 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 7383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:17:57,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 328 Invalid, 7545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 7383 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 03:17:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 03:17:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2022-04-28 03:17:57,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:57,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 03:17:57,938 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 03:17:57,939 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 03:17:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:57,941 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-28 03:17:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-28 03:17:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:57,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:57,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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) Second operand 141 states. [2022-04-28 03:17:57,942 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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) Second operand 141 states. [2022-04-28 03:17:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:57,943 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-28 03:17:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-28 03:17:57,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:57,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:57,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 03:17:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-28 03:17:57,950 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 130 [2022-04-28 03:17:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:57,950 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-28 03:17:57,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 80 states have internal predecessors, (126), 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 03:17:57,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-28 03:17:58,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:17:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-28 03:17:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 03:17:58,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:58,152 INFO L195 NwaCegarLoop]: trace histogram [41, 40, 39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:17:58,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 03:17:58,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 03:17:58,352 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2015973251, now seen corresponding path program 41 times [2022-04-28 03:17:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:58,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151599843] [2022-04-28 03:18:02,454 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:18:02,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:02,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:02,816 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash 814899403, now seen corresponding path program 1 times [2022-04-28 03:18:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:02,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962924353] [2022-04-28 03:18:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:02,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:02,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {30107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-28 03:18:02,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-28 03:18:02,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30104#(= main_~x~0 0)} is VALID [2022-04-28 03:18:02,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {30104#(= main_~x~0 0)} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30104#(= main_~x~0 0)} is VALID [2022-04-28 03:18:02,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {30104#(= main_~x~0 0)} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30104#(= main_~x~0 0)} is VALID [2022-04-28 03:18:02,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {30104#(= main_~x~0 0)} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:02,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:02,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30106#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:02,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(<= 48 main_~y~0)} assume ~y~0 < 0; {30100#false} is VALID [2022-04-28 03:18:02,862 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-28 03:18:02,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-28 03:18:02,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-28 03:18:02,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-28 03:18:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962924353] [2022-04-28 03:18:02,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962924353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155625766] [2022-04-28 03:18:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:02,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:02,864 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:18:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 03:18:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:02,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:18:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:02,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:03,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30099#true} is VALID [2022-04-28 03:18:03,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#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(9, 2); {30099#true} is VALID [2022-04-28 03:18:03,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-28 03:18:03,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-28 03:18:03,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-28 03:18:03,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:03,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:03,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:03,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {30126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:18:03,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:18:03,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {30136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30143#(<= 49 main_~y~0)} is VALID [2022-04-28 03:18:03,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {30143#(<= 49 main_~y~0)} assume ~y~0 < 0; {30100#false} is VALID [2022-04-28 03:18:03,052 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-28 03:18:03,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-28 03:18:03,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-28 03:18:03,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-28 03:18:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:03,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:03,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#false} assume !false; {30100#false} is VALID [2022-04-28 03:18:03,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {30100#false} assume 0 == ~cond; {30100#false} is VALID [2022-04-28 03:18:03,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {30100#false} ~cond := #in~cond; {30100#false} is VALID [2022-04-28 03:18:03,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {30100#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {30100#false} is VALID [2022-04-28 03:18:03,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {30171#(not (< main_~y~0 0))} assume ~y~0 < 0; {30100#false} is VALID [2022-04-28 03:18:03,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {30171#(not (< main_~y~0 0))} is VALID [2022-04-28 03:18:03,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} [222] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:03,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [225] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1542 1))) (.cse1 (= |v_main_#t~post1_283| |v_main_#t~post1_282|)) (.cse2 (= |v_main_#t~post3_559| |v_main_#t~post3_555|)) (.cse3 (= v_main_~x~0_1426 v_main_~x~0_1425)) (.cse4 (= v_main_~y~0_1542 v_main_~y~0_1541))) (or (and (< v_main_~x~0_1425 51) (= (+ v_main_~x~0_1426 v_main_~y~0_1541) (+ v_main_~x~0_1425 v_main_~y~0_1542)) (< v_main_~x~0_1426 v_main_~x~0_1425) .cse0) (and (or (not (< v_main_~x~0_1426 50)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1542, main_#t~post3=|v_main_#t~post3_559|, main_~x~0=v_main_~x~0_1426, main_#t~post1=|v_main_#t~post1_283|} OutVars{main_~y~0=v_main_~y~0_1541, main_#t~post3=|v_main_#t~post3_555|, main_~x~0=v_main_~x~0_1425, main_#t~post1=|v_main_#t~post1_282|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {30175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:03,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [224] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:03,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {30189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [223] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_315| |v_main_#t~post2_314|)) (.cse1 (= v_main_~x~0_1424 v_main_~x~0_1423)) (.cse2 (= v_main_~y~0_1540 v_main_~y~0_1539)) (.cse3 (= |v_main_#t~post3_556| |v_main_#t~post3_554|)) (.cse4 (<= 50 v_main_~x~0_1424))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (<= 1 v_main_~y~0_1540)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 v_main_~y~0_1539) (= (+ v_main_~x~0_1424 v_main_~y~0_1540) (+ v_main_~x~0_1423 v_main_~y~0_1539)) (< v_main_~y~0_1539 v_main_~y~0_1540) .cse4))) InVars {main_~y~0=v_main_~y~0_1540, main_#t~post2=|v_main_#t~post2_315|, main_#t~post3=|v_main_#t~post3_556|, main_~x~0=v_main_~x~0_1424} OutVars{main_~y~0=v_main_~y~0_1539, main_#t~post2=|v_main_#t~post2_314|, main_#t~post3=|v_main_#t~post3_554|, main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {30182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:03,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {30099#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {30189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:18:03,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {30099#true} call #t~ret4 := main(); {30099#true} is VALID [2022-04-28 03:18:03,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30099#true} {30099#true} #61#return; {30099#true} is VALID [2022-04-28 03:18:03,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {30099#true} assume true; {30099#true} is VALID [2022-04-28 03:18:03,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {30099#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(9, 2); {30099#true} is VALID [2022-04-28 03:18:03,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {30099#true} call ULTIMATE.init(); {30099#true} is VALID [2022-04-28 03:18:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:03,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155625766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:03,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:03,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:18:05,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:05,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151599843] [2022-04-28 03:18:05,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151599843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-28 03:18:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747382670] [2022-04-28 03:18:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 133 [2022-04-28 03:18:05,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:05,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 03:18:05,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:05,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-28 03:18:05,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:05,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-28 03:18:05,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=7346, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 03:18:05,900 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 03:18:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:15,099 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2022-04-28 03:18:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-28 03:18:15,099 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 133 [2022-04-28 03:18:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 03:18:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 145 transitions. [2022-04-28 03:18:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 03:18:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 145 transitions. [2022-04-28 03:18:15,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 145 transitions. [2022-04-28 03:18:15,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:15,177 INFO L225 Difference]: With dead ends: 159 [2022-04-28 03:18:15,177 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 03:18:15,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8214 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1479, Invalid=26577, Unknown=0, NotChecked=0, Total=28056 [2022-04-28 03:18:15,178 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7680 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 7680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:15,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 159 Invalid, 7871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 7680 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 03:18:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 03:18:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2022-04-28 03:18:15,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:15,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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 03:18:15,522 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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 03:18:15,522 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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 03:18:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:15,524 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:18:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:18:15,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:15,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:15,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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) Second operand 144 states. [2022-04-28 03:18:15,524 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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) Second operand 144 states. [2022-04-28 03:18:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:15,525 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:18:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:18:15,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:15,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:15,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:15,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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 03:18:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2022-04-28 03:18:15,527 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 133 [2022-04-28 03:18:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:15,527 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2022-04-28 03:18:15,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 82 states have internal predecessors, (129), 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 03:18:15,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 147 transitions. [2022-04-28 03:18:15,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2022-04-28 03:18:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 03:18:15,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:15,669 INFO L195 NwaCegarLoop]: trace histogram [42, 41, 40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:15,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 03:18:15,883 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash -377244633, now seen corresponding path program 42 times [2022-04-28 03:18:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:15,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598920273] [2022-04-28 03:18:16,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:16,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:16,202 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash -974683701, now seen corresponding path program 1 times [2022-04-28 03:18:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388142633] [2022-04-28 03:18:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:16,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-28 03:18:16,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-28 03:18:16,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-28 03:18:16,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:16,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {31343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {31335#true} is VALID [2022-04-28 03:18:16,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-28 03:18:16,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-28 03:18:16,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-28 03:18:16,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31340#(= main_~x~0 0)} is VALID [2022-04-28 03:18:16,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {31340#(= main_~x~0 0)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31340#(= main_~x~0 0)} is VALID [2022-04-28 03:18:16,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {31340#(= main_~x~0 0)} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31340#(= main_~x~0 0)} is VALID [2022-04-28 03:18:16,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {31340#(= main_~x~0 0)} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {31341#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31342#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {31342#(<= 48 main_~y~0)} assume ~y~0 < 0; {31336#false} is VALID [2022-04-28 03:18:16,254 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-28 03:18:16,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-28 03:18:16,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-28 03:18:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388142633] [2022-04-28 03:18:16,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388142633] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:16,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896316990] [2022-04-28 03:18:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:16,256 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:18:16,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 03:18:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:16,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:18:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:16,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31335#true} is VALID [2022-04-28 03:18:16,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#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(9, 2); {31335#true} is VALID [2022-04-28 03:18:16,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-28 03:18:16,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-28 03:18:16,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-28 03:18:16,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31362#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:16,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {31362#(<= main_~x~0 0)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31362#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:16,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {31362#(<= main_~x~0 0)} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31362#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:16,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {31362#(<= main_~x~0 0)} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:16,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:16,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {31372#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31342#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:16,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {31342#(<= 48 main_~y~0)} assume ~y~0 < 0; {31336#false} is VALID [2022-04-28 03:18:16,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-28 03:18:16,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-28 03:18:16,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-28 03:18:16,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-28 03:18:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:16,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:16,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {31336#false} assume !false; {31336#false} is VALID [2022-04-28 03:18:16,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {31336#false} assume 0 == ~cond; {31336#false} is VALID [2022-04-28 03:18:16,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {31336#false} ~cond := #in~cond; {31336#false} is VALID [2022-04-28 03:18:16,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {31336#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {31336#false} is VALID [2022-04-28 03:18:16,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {31406#(not (< main_~y~0 0))} assume ~y~0 < 0; {31336#false} is VALID [2022-04-28 03:18:16,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {31406#(not (< main_~y~0 0))} is VALID [2022-04-28 03:18:16,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} [226] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:16,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [229] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 0 (+ v_main_~y~0_1601 1))) (.cse1 (= |v_main_#t~post3_573| |v_main_#t~post3_569|)) (.cse2 (= v_main_~y~0_1601 v_main_~y~0_1600)) (.cse3 (= |v_main_#t~post1_290| |v_main_#t~post1_289|)) (.cse4 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (< v_main_~x~0_1482 v_main_~x~0_1481) .cse0 (= (+ v_main_~x~0_1481 v_main_~y~0_1601) (+ v_main_~x~0_1482 v_main_~y~0_1600)) (< v_main_~x~0_1481 51)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1482 50))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1601, main_#t~post3=|v_main_#t~post3_573|, main_~x~0=v_main_~x~0_1482, main_#t~post1=|v_main_#t~post1_290|} OutVars{main_~y~0=v_main_~y~0_1600, main_#t~post3=|v_main_#t~post3_569|, main_~x~0=v_main_~x~0_1481, main_#t~post1=|v_main_#t~post1_289|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {31410#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:16,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [228] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:16,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {31424#(<= main_~x~0 48)} [227] L28-2-->L29_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_323| |v_main_#t~post2_322|)) (.cse2 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse3 (= |v_main_#t~post3_570| |v_main_#t~post3_568|)) (.cse1 (<= 50 v_main_~x~0_1480))) (or (and .cse0 (or (not .cse1) (not (<= 1 v_main_~y~0_1599))) .cse2 (= v_main_~x~0_1479 v_main_~x~0_1480) .cse3) (and .cse0 (= v_main_~x~0_1480 v_main_~x~0_1479) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1480 v_main_~y~0_1599))) (and (<= v_main_~x~0_1479 .cse4) (< v_main_~x~0_1480 v_main_~x~0_1479) (= (+ v_main_~x~0_1479 v_main_~y~0_1598) .cse4) .cse1)))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post2=|v_main_#t~post2_323|, main_#t~post3=|v_main_#t~post3_570|, main_~x~0=v_main_~x~0_1480} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post2=|v_main_#t~post2_322|, main_#t~post3=|v_main_#t~post3_568|, main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {31417#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:16,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {31335#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {31424#(<= main_~x~0 48)} is VALID [2022-04-28 03:18:16,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {31335#true} call #t~ret4 := main(); {31335#true} is VALID [2022-04-28 03:18:16,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31335#true} {31335#true} #61#return; {31335#true} is VALID [2022-04-28 03:18:16,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {31335#true} assume true; {31335#true} is VALID [2022-04-28 03:18:16,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {31335#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(9, 2); {31335#true} is VALID [2022-04-28 03:18:16,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {31335#true} call ULTIMATE.init(); {31335#true} is VALID [2022-04-28 03:18:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:16,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896316990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:16,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:18:19,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:19,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598920273] [2022-04-28 03:18:19,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598920273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:19,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:19,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2022-04-28 03:18:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211801274] [2022-04-28 03:18:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 136 [2022-04-28 03:18:19,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:19,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 03:18:19,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:19,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-04-28 03:18:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-04-28 03:18:19,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=7476, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 03:18:19,640 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 03:18:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:29,627 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2022-04-28 03:18:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-28 03:18:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 136 [2022-04-28 03:18:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 03:18:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 148 transitions. [2022-04-28 03:18:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 03:18:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 148 transitions. [2022-04-28 03:18:29,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 148 transitions. [2022-04-28 03:18:29,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:29,706 INFO L225 Difference]: With dead ends: 162 [2022-04-28 03:18:29,706 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 03:18:29,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8455 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1592, Invalid=27478, Unknown=0, NotChecked=0, Total=29070 [2022-04-28 03:18:29,708 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 93 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 8182 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 8360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 8182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:29,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 295 Invalid, 8360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 8182 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 03:18:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 03:18:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-04-28 03:18:30,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:30,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 03:18:30,117 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 03:18:30,117 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 03:18:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:30,118 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2022-04-28 03:18:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2022-04-28 03:18:30,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:30,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:30,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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) Second operand 147 states. [2022-04-28 03:18:30,118 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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) Second operand 147 states. [2022-04-28 03:18:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:30,119 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2022-04-28 03:18:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2022-04-28 03:18:30,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:30,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:30,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:30,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 03:18:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-28 03:18:30,121 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 136 [2022-04-28 03:18:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:30,121 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-28 03:18:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 84 states have internal predecessors, (132), 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 03:18:30,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-28 03:18:30,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-28 03:18:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 03:18:30,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:30,282 INFO L195 NwaCegarLoop]: trace histogram [43, 42, 41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:30,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:30,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:30,487 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -274113277, now seen corresponding path program 43 times [2022-04-28 03:18:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:30,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831499569] [2022-04-28 03:18:30,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:30,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:30,845 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1530700491, now seen corresponding path program 1 times [2022-04-28 03:18:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:30,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137006018] [2022-04-28 03:18:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:30,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {32603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-28 03:18:30,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-28 03:18:30,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32599#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:18:30,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {32599#(and (= main_~x~0 0) (= main_~y~0 0))} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:30,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:30,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {32600#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:30,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:30,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {32601#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32602#(<= 49 main_~y~0)} is VALID [2022-04-28 03:18:30,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {32602#(<= 49 main_~y~0)} assume ~y~0 < 0; {32595#false} is VALID [2022-04-28 03:18:30,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-28 03:18:30,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-28 03:18:30,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-28 03:18:30,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-28 03:18:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:30,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137006018] [2022-04-28 03:18:30,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137006018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264701581] [2022-04-28 03:18:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:30,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:30,904 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:18:30,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 03:18:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:18:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:30,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:31,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32594#true} is VALID [2022-04-28 03:18:31,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#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(9, 2); {32594#true} is VALID [2022-04-28 03:18:31,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-28 03:18:31,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-28 03:18:31,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-28 03:18:31,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32622#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:31,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {32622#(<= main_~x~0 0)} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32622#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:31,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {32622#(<= main_~x~0 0)} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32622#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:31,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {32622#(<= main_~x~0 0)} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:31,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:31,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {32632#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32639#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:31,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {32639#(<= 48 main_~y~0)} assume ~y~0 < 0; {32595#false} is VALID [2022-04-28 03:18:31,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-28 03:18:31,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-28 03:18:31,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-28 03:18:31,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-28 03:18:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:31,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:31,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {32595#false} assume !false; {32595#false} is VALID [2022-04-28 03:18:31,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {32595#false} assume 0 == ~cond; {32595#false} is VALID [2022-04-28 03:18:31,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {32595#false} ~cond := #in~cond; {32595#false} is VALID [2022-04-28 03:18:31,335 INFO L272 TraceCheckUtils]: 12: Hoare triple {32595#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {32595#false} is VALID [2022-04-28 03:18:31,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {32667#(not (< main_~y~0 0))} assume ~y~0 < 0; {32595#false} is VALID [2022-04-28 03:18:31,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {32667#(not (< main_~y~0 0))} is VALID [2022-04-28 03:18:31,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} [230] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:31,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [233] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1661 1))) (.cse0 (= |v_main_#t~post1_297| |v_main_#t~post1_296|)) (.cse1 (= v_main_~y~0_1661 v_main_~y~0_1660)) (.cse2 (= |v_main_#t~post3_587| |v_main_#t~post3_583|))) (or (and (= v_main_~x~0_1539 v_main_~x~0_1538) .cse0 .cse1 .cse2) (and (< v_main_~x~0_1538 51) (= (+ v_main_~x~0_1538 v_main_~y~0_1661) (+ v_main_~x~0_1539 v_main_~y~0_1660)) (< v_main_~x~0_1539 v_main_~x~0_1538) .cse3) (and (or (not .cse3) (not (< v_main_~x~0_1539 50))) .cse0 .cse1 (= v_main_~x~0_1538 v_main_~x~0_1539) .cse2))) InVars {main_~y~0=v_main_~y~0_1661, main_#t~post3=|v_main_#t~post3_587|, main_~x~0=v_main_~x~0_1539, main_#t~post1=|v_main_#t~post1_297|} OutVars{main_~y~0=v_main_~y~0_1660, main_#t~post3=|v_main_#t~post3_583|, main_~x~0=v_main_~x~0_1538, main_#t~post1=|v_main_#t~post1_296|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {32671#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:31,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [232] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:31,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {32685#(<= main_~x~0 48)} [231] L28-2-->L29_primed: Formula: (let ((.cse1 (<= 50 v_main_~x~0_1537)) (.cse2 (= v_main_~y~0_1659 v_main_~y~0_1658)) (.cse3 (= |v_main_#t~post3_584| |v_main_#t~post3_582|)) (.cse4 (= v_main_~x~0_1537 v_main_~x~0_1536)) (.cse5 (= |v_main_#t~post2_331| |v_main_#t~post2_330|))) (or (let ((.cse0 (+ v_main_~x~0_1537 v_main_~y~0_1659))) (and (< v_main_~x~0_1537 v_main_~x~0_1536) (= (+ v_main_~x~0_1536 v_main_~y~0_1658) .cse0) (<= v_main_~x~0_1536 .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (<= 1 v_main_~y~0_1659)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1659, main_#t~post2=|v_main_#t~post2_331|, main_#t~post3=|v_main_#t~post3_584|, main_~x~0=v_main_~x~0_1537} OutVars{main_~y~0=v_main_~y~0_1658, main_#t~post2=|v_main_#t~post2_330|, main_#t~post3=|v_main_#t~post3_582|, main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {32678#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:31,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {32594#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {32685#(<= main_~x~0 48)} is VALID [2022-04-28 03:18:31,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {32594#true} call #t~ret4 := main(); {32594#true} is VALID [2022-04-28 03:18:31,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32594#true} {32594#true} #61#return; {32594#true} is VALID [2022-04-28 03:18:31,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {32594#true} assume true; {32594#true} is VALID [2022-04-28 03:18:31,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {32594#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(9, 2); {32594#true} is VALID [2022-04-28 03:18:31,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {32594#true} call ULTIMATE.init(); {32594#true} is VALID [2022-04-28 03:18:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264701581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:31,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:31,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:18:33,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831499569] [2022-04-28 03:18:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831499569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:33,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2022-04-28 03:18:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503056670] [2022-04-28 03:18:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:33,812 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 139 [2022-04-28 03:18:33,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:33,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 03:18:33,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-28 03:18:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-28 03:18:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=8404, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:18:33,901 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 03:18:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:46,713 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2022-04-28 03:18:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-28 03:18:46,714 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 139 [2022-04-28 03:18:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:18:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 03:18:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2022-04-28 03:18:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 03:18:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2022-04-28 03:18:46,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 151 transitions. [2022-04-28 03:18:46,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:46,798 INFO L225 Difference]: With dead ends: 165 [2022-04-28 03:18:46,798 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 03:18:46,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4659 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1639, Invalid=30581, Unknown=0, NotChecked=0, Total=32220 [2022-04-28 03:18:46,800 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 11008 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 11178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 11008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:18:46,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 441 Invalid, 11178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 11008 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 03:18:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 03:18:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-28 03:18:47,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:18:47,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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 03:18:47,381 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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 03:18:47,381 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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 03:18:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:47,383 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2022-04-28 03:18:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-28 03:18:47,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:47,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:47,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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) Second operand 150 states. [2022-04-28 03:18:47,383 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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) Second operand 150 states. [2022-04-28 03:18:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:18:47,384 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2022-04-28 03:18:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-28 03:18:47,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:18:47,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:18:47,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:18:47,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:18:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 144 states have internal predecessors, (149), 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 03:18:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2022-04-28 03:18:47,386 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 139 [2022-04-28 03:18:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:18:47,386 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2022-04-28 03:18:47,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 87 states have internal predecessors, (135), 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 03:18:47,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 153 transitions. [2022-04-28 03:18:47,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-28 03:18:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-28 03:18:47,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:18:47,539 INFO L195 NwaCegarLoop]: trace histogram [44, 43, 42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:18:47,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:18:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:47,755 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:18:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:18:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1210496679, now seen corresponding path program 44 times [2022-04-28 03:18:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:47,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725668213] [2022-04-28 03:18:47,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:48,011 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:18:48,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:18:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -258882613, now seen corresponding path program 1 times [2022-04-28 03:18:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:18:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142075187] [2022-04-28 03:18:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:18:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:18:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:48,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-28 03:18:48,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-28 03:18:48,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-28 03:18:48,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:18:48,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {33892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {33884#true} is VALID [2022-04-28 03:18:48,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-28 03:18:48,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-28 03:18:48,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-28 03:18:48,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33889#(= main_~x~0 0)} is VALID [2022-04-28 03:18:48,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {33889#(= main_~x~0 0)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33889#(= main_~x~0 0)} is VALID [2022-04-28 03:18:48,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {33889#(= main_~x~0 0)} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33889#(= main_~x~0 0)} is VALID [2022-04-28 03:18:48,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {33889#(= main_~x~0 0)} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:48,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:18:48,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {33890#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33891#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:48,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {33891#(<= 48 main_~y~0)} assume ~y~0 < 0; {33885#false} is VALID [2022-04-28 03:18:48,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-28 03:18:48,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-28 03:18:48,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-28 03:18:48,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-28 03:18:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:18:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142075187] [2022-04-28 03:18:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142075187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:18:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278031088] [2022-04-28 03:18:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:18:48,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:18:48,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:18:48,055 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:18:48,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 03:18:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:48,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:18:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:18:48,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:18:48,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33884#true} is VALID [2022-04-28 03:18:48,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#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(9, 2); {33884#true} is VALID [2022-04-28 03:18:48,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-28 03:18:48,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-28 03:18:48,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-28 03:18:48,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33911#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:48,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {33911#(<= main_~x~0 0)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33911#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:48,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {33911#(<= main_~x~0 0)} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33911#(<= main_~x~0 0)} is VALID [2022-04-28 03:18:48,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {33911#(<= main_~x~0 0)} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:48,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:18:48,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {33921#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33891#(<= 48 main_~y~0)} is VALID [2022-04-28 03:18:48,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {33891#(<= 48 main_~y~0)} assume ~y~0 < 0; {33885#false} is VALID [2022-04-28 03:18:48,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-28 03:18:48,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-28 03:18:48,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-28 03:18:48,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-28 03:18:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:18:48,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:18:48,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {33885#false} assume !false; {33885#false} is VALID [2022-04-28 03:18:48,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {33885#false} assume 0 == ~cond; {33885#false} is VALID [2022-04-28 03:18:48,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {33885#false} ~cond := #in~cond; {33885#false} is VALID [2022-04-28 03:18:48,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {33885#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {33885#false} is VALID [2022-04-28 03:18:48,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {33955#(not (< main_~y~0 0))} assume ~y~0 < 0; {33885#false} is VALID [2022-04-28 03:18:48,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {33955#(not (< main_~y~0 0))} is VALID [2022-04-28 03:18:48,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} [234] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:48,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [237] L28-2-->L29_primed: Formula: (let ((.cse1 (= v_main_~y~0_1722 v_main_~y~0_1721)) (.cse2 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse3 (= |v_main_#t~post3_601| |v_main_#t~post3_597|)) (.cse4 (= |v_main_#t~post1_304| |v_main_#t~post1_303|)) (.cse0 (<= 0 (+ v_main_~y~0_1722 1)))) (or (and .cse0 (< v_main_~x~0_1597 v_main_~x~0_1596) (= (+ v_main_~x~0_1597 v_main_~y~0_1721) (+ v_main_~x~0_1596 v_main_~y~0_1722)) (< v_main_~x~0_1596 51)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1597 50)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1722, main_#t~post3=|v_main_#t~post3_601|, main_~x~0=v_main_~x~0_1597, main_#t~post1=|v_main_#t~post1_304|} OutVars{main_~y~0=v_main_~y~0_1721, main_#t~post3=|v_main_#t~post3_597|, main_~x~0=v_main_~x~0_1596, main_#t~post1=|v_main_#t~post1_303|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {33959#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:18:48,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [236] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:48,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {33973#(<= main_~x~0 48)} [235] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1595)) (.cse1 (= |v_main_#t~post3_598| |v_main_#t~post3_596|)) (.cse2 (= v_main_~x~0_1595 v_main_~x~0_1594)) (.cse3 (= |v_main_#t~post2_339| |v_main_#t~post2_338|))) (or (and (or (not .cse0) (not (<= 1 v_main_~y~0_1720))) .cse1 .cse2 .cse3 (= v_main_~y~0_1719 v_main_~y~0_1720)) (let ((.cse4 (+ v_main_~x~0_1595 v_main_~y~0_1720))) (and (<= v_main_~x~0_1594 .cse4) (= .cse4 (+ v_main_~x~0_1594 v_main_~y~0_1719)) .cse0 (< v_main_~x~0_1595 v_main_~x~0_1594))) (and .cse1 .cse2 .cse3 (= v_main_~y~0_1720 v_main_~y~0_1719)))) InVars {main_~y~0=v_main_~y~0_1720, main_#t~post2=|v_main_#t~post2_339|, main_#t~post3=|v_main_#t~post3_598|, main_~x~0=v_main_~x~0_1595} OutVars{main_~y~0=v_main_~y~0_1719, main_#t~post2=|v_main_#t~post2_338|, main_#t~post3=|v_main_#t~post3_596|, main_~x~0=v_main_~x~0_1594} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {33966#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:18:48,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {33884#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {33973#(<= main_~x~0 48)} is VALID [2022-04-28 03:18:48,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {33884#true} call #t~ret4 := main(); {33884#true} is VALID [2022-04-28 03:18:48,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33884#true} {33884#true} #61#return; {33884#true} is VALID [2022-04-28 03:18:48,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {33884#true} assume true; {33884#true} is VALID [2022-04-28 03:18:48,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {33884#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(9, 2); {33884#true} is VALID [2022-04-28 03:18:48,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {33884#true} call ULTIMATE.init(); {33884#true} is VALID [2022-04-28 03:18:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:18:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278031088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:18:48,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:18:48,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:18:50,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:18:50,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725668213] [2022-04-28 03:18:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725668213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:18:50,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:18:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-28 03:18:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768525327] [2022-04-28 03:18:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:18:50,899 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 142 [2022-04-28 03:18:50,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:18:50,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 03:18:50,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:18:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-28 03:18:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:18:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-28 03:18:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=8182, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 03:18:50,962 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 03:19:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:00,720 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2022-04-28 03:19:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-28 03:19:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 142 [2022-04-28 03:19:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 03:19:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 154 transitions. [2022-04-28 03:19:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 03:19:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 154 transitions. [2022-04-28 03:19:00,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 154 transitions. [2022-04-28 03:19:00,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:00,808 INFO L225 Difference]: With dead ends: 168 [2022-04-28 03:19:00,808 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 03:19:00,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9297 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1670, Invalid=30192, Unknown=0, NotChecked=0, Total=31862 [2022-04-28 03:19:00,810 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 97 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8714 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 8899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 8714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:00,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 307 Invalid, 8899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 8714 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 03:19:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 03:19:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-04-28 03:19:01,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:01,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 03:19:01,179 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 03:19:01,182 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 03:19:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:01,184 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-28 03:19:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-28 03:19:01,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:01,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:01,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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) Second operand 153 states. [2022-04-28 03:19:01,184 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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) Second operand 153 states. [2022-04-28 03:19:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:01,185 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-28 03:19:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-28 03:19:01,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:01,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:01,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:01,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 03:19:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-28 03:19:01,187 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 142 [2022-04-28 03:19:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:01,187 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-28 03:19:01,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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 03:19:01,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-28 03:19:01,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-28 03:19:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 03:19:01,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:01,343 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:01,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 03:19:01,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 03:19:01,558 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -347518333, now seen corresponding path program 45 times [2022-04-28 03:19:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:01,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111002137] [2022-04-28 03:19:01,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:01,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:01,992 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2048465717, now seen corresponding path program 1 times [2022-04-28 03:19:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:01,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832301879] [2022-04-28 03:19:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:02,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-28 03:19:02,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-28 03:19:02,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-28 03:19:02,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:02,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {35199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {35191#true} is VALID [2022-04-28 03:19:02,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-28 03:19:02,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-28 03:19:02,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-28 03:19:02,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35196#(= main_~x~0 0)} is VALID [2022-04-28 03:19:02,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {35196#(= main_~x~0 0)} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35196#(= main_~x~0 0)} is VALID [2022-04-28 03:19:02,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {35196#(= main_~x~0 0)} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35196#(= main_~x~0 0)} is VALID [2022-04-28 03:19:02,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {35196#(= main_~x~0 0)} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:02,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:02,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {35197#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35198#(<= 48 main_~y~0)} is VALID [2022-04-28 03:19:02,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {35198#(<= 48 main_~y~0)} assume ~y~0 < 0; {35192#false} is VALID [2022-04-28 03:19:02,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-28 03:19:02,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-28 03:19:02,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-28 03:19:02,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-28 03:19:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:19:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832301879] [2022-04-28 03:19:02,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832301879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081541655] [2022-04-28 03:19:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:02,108 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:19:02,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 03:19:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:02,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:19:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:02,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:02,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35191#true} is VALID [2022-04-28 03:19:02,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#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(9, 2); {35191#true} is VALID [2022-04-28 03:19:02,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-28 03:19:02,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-28 03:19:02,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-28 03:19:02,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:19:02,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:19:02,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:19:02,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {35218#(and (<= main_~x~0 0) (= main_~y~0 0))} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:19:02,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} is VALID [2022-04-28 03:19:02,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {35228#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= main_~x~0 0) (= main_~y~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35235#(<= 49 main_~y~0)} is VALID [2022-04-28 03:19:02,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {35235#(<= 49 main_~y~0)} assume ~y~0 < 0; {35192#false} is VALID [2022-04-28 03:19:02,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-28 03:19:02,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-28 03:19:02,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-28 03:19:02,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-28 03:19:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:19:02,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:02,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {35192#false} assume !false; {35192#false} is VALID [2022-04-28 03:19:02,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {35192#false} assume 0 == ~cond; {35192#false} is VALID [2022-04-28 03:19:02,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {35192#false} ~cond := #in~cond; {35192#false} is VALID [2022-04-28 03:19:02,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {35192#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {35192#false} is VALID [2022-04-28 03:19:02,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {35263#(not (< main_~y~0 0))} assume ~y~0 < 0; {35192#false} is VALID [2022-04-28 03:19:02,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {35263#(not (< main_~y~0 0))} is VALID [2022-04-28 03:19:02,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} [238] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:02,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [241] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1784 1))) (.cse0 (= v_main_~y~0_1784 v_main_~y~0_1783)) (.cse1 (= v_main_~x~0_1656 v_main_~x~0_1655)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_611|)) (.cse4 (= |v_main_#t~post1_311| |v_main_#t~post1_310|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1656 50)) (not .cse2)) .cse3 .cse4) (and (< v_main_~x~0_1655 51) (< v_main_~x~0_1656 v_main_~x~0_1655) .cse2 (= (+ v_main_~x~0_1656 v_main_~y~0_1783) (+ v_main_~x~0_1655 v_main_~y~0_1784))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1784, main_#t~post3=|v_main_#t~post3_615|, main_~x~0=v_main_~x~0_1656, main_#t~post1=|v_main_#t~post1_311|} OutVars{main_~y~0=v_main_~y~0_1783, main_#t~post3=|v_main_#t~post3_611|, main_~x~0=v_main_~x~0_1655, main_#t~post1=|v_main_#t~post1_310|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {35267#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:02,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [240] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:19:02,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [239] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1654 v_main_~x~0_1653)) (.cse1 (= v_main_~y~0_1782 v_main_~y~0_1781)) (.cse2 (= |v_main_#t~post3_612| |v_main_#t~post3_610|)) (.cse3 (= |v_main_#t~post2_347| |v_main_#t~post2_346|)) (.cse4 (<= 50 v_main_~x~0_1654))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1782)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_1654 v_main_~y~0_1782))) (and (< v_main_~x~0_1654 v_main_~x~0_1653) (<= v_main_~x~0_1653 .cse5) (= .cse5 (+ v_main_~x~0_1653 v_main_~y~0_1781)) .cse4)))) InVars {main_~y~0=v_main_~y~0_1782, main_#t~post2=|v_main_#t~post2_347|, main_#t~post3=|v_main_#t~post3_612|, main_~x~0=v_main_~x~0_1654} OutVars{main_~y~0=v_main_~y~0_1781, main_#t~post2=|v_main_#t~post2_346|, main_#t~post3=|v_main_#t~post3_610|, main_~x~0=v_main_~x~0_1653} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {35274#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:19:02,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {35191#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {35281#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:19:02,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {35191#true} call #t~ret4 := main(); {35191#true} is VALID [2022-04-28 03:19:02,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35191#true} {35191#true} #61#return; {35191#true} is VALID [2022-04-28 03:19:02,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {35191#true} assume true; {35191#true} is VALID [2022-04-28 03:19:02,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {35191#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(9, 2); {35191#true} is VALID [2022-04-28 03:19:02,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {35191#true} call ULTIMATE.init(); {35191#true} is VALID [2022-04-28 03:19:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:02,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081541655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:02,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:02,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:19:05,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111002137] [2022-04-28 03:19:05,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111002137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:05,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:05,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2022-04-28 03:19:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225767614] [2022-04-28 03:19:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 145 [2022-04-28 03:19:05,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:05,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 03:19:05,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:05,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-04-28 03:19:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-04-28 03:19:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=8778, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:19:05,966 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 03:19:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:17,233 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2022-04-28 03:19:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-28 03:19:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 145 [2022-04-28 03:19:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 03:19:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 157 transitions. [2022-04-28 03:19:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 03:19:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 157 transitions. [2022-04-28 03:19:17,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 157 transitions. [2022-04-28 03:19:17,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:17,375 INFO L225 Difference]: With dead ends: 171 [2022-04-28 03:19:17,375 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 03:19:17,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9914 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1627, Invalid=32045, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:19:17,376 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 99 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9052 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 9052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:17,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 223 Invalid, 9256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 9052 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 03:19:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 03:19:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-04-28 03:19:17,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:17,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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 03:19:17,740 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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 03:19:17,740 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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 03:19:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:17,742 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2022-04-28 03:19:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-28 03:19:17,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:17,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:17,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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) Second operand 156 states. [2022-04-28 03:19:17,742 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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) Second operand 156 states. [2022-04-28 03:19:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:17,743 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2022-04-28 03:19:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-28 03:19:17,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:17,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:17,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:17,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0333333333333334) internal successors, (155), 150 states have internal predecessors, (155), 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 03:19:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2022-04-28 03:19:17,745 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 145 [2022-04-28 03:19:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:17,745 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2022-04-28 03:19:17,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 90 states have internal predecessors, (141), 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 03:19:17,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 159 transitions. [2022-04-28 03:19:17,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2022-04-28 03:19:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-28 03:19:17,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:17,921 INFO L195 NwaCegarLoop]: trace histogram [46, 45, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:17,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 03:19:18,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 03:19:18,132 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 538827047, now seen corresponding path program 46 times [2022-04-28 03:19:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:18,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412003355] [2022-04-28 03:19:18,288 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:21,804 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:19:21,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:21,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 456918475, now seen corresponding path program 1 times [2022-04-28 03:19:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:21,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61888078] [2022-04-28 03:19:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:21,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-28 03:19:21,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-28 03:19:21,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-28 03:19:21,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:21,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {36532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {36523#true} is VALID [2022-04-28 03:19:21,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-28 03:19:21,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-28 03:19:21,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-28 03:19:21,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36528#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:19:21,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {36528#(and (= main_~x~0 0) (= main_~y~0 0))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:21,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:21,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {36529#(and (<= main_~x~0 49) (< 0 (+ main_~y~0 1)))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:21,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:21,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36531#(<= 0 main_~y~0)} is VALID [2022-04-28 03:19:21,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {36531#(<= 0 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-28 03:19:21,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-28 03:19:21,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-28 03:19:21,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-28 03:19:21,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-28 03:19:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:21,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61888078] [2022-04-28 03:19:21,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61888078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:21,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415908474] [2022-04-28 03:19:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:21,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:21,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:21,974 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:19:21,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 03:19:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:22,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:19:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:22,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:22,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36523#true} is VALID [2022-04-28 03:19:22,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#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(9, 2); {36523#true} is VALID [2022-04-28 03:19:22,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-28 03:19:22,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-28 03:19:22,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-28 03:19:22,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:22,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:22,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:22,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {36551#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:19:22,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:19:22,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {36561#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36568#(<= 49 main_~y~0)} is VALID [2022-04-28 03:19:22,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {36568#(<= 49 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-28 03:19:22,220 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-28 03:19:22,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-28 03:19:22,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-28 03:19:22,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-28 03:19:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:19:22,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:22,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {36524#false} assume !false; {36524#false} is VALID [2022-04-28 03:19:22,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {36524#false} assume 0 == ~cond; {36524#false} is VALID [2022-04-28 03:19:22,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {36524#false} ~cond := #in~cond; {36524#false} is VALID [2022-04-28 03:19:22,572 INFO L272 TraceCheckUtils]: 12: Hoare triple {36524#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {36524#false} is VALID [2022-04-28 03:19:22,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {36531#(<= 0 main_~y~0)} assume ~y~0 < 0; {36524#false} is VALID [2022-04-28 03:19:22,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {36531#(<= 0 main_~y~0)} is VALID [2022-04-28 03:19:22,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} [242] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:22,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [245] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1847 1))) (.cse0 (= v_main_~x~0_1716 v_main_~x~0_1715)) (.cse1 (= |v_main_#t~post1_318| |v_main_#t~post1_317|)) (.cse3 (= |v_main_#t~post3_629| |v_main_#t~post3_625|)) (.cse4 (= v_main_~y~0_1847 v_main_~y~0_1846))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1716 50)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1716 v_main_~y~0_1846))) (and .cse2 (= .cse5 (+ v_main_~x~0_1715 v_main_~y~0_1847)) (< .cse5 (+ 51 v_main_~y~0_1847)) (< v_main_~y~0_1847 v_main_~y~0_1846))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1847, main_#t~post3=|v_main_#t~post3_629|, main_~x~0=v_main_~x~0_1716, main_#t~post1=|v_main_#t~post1_318|} OutVars{main_~y~0=v_main_~y~0_1846, main_#t~post3=|v_main_#t~post3_625|, main_~x~0=v_main_~x~0_1715, main_#t~post1=|v_main_#t~post1_317|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {36530#(or (<= main_~x~0 49) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:22,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} [244] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-28 03:19:22,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {36612#(and (<= main_~x~0 49) (or (< (+ main_~y~0 1) 0) (<= main_~x~0 (+ 49 main_~y~0))))} [243] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1714)) (.cse1 (= |v_main_#t~post2_355| |v_main_#t~post2_354|)) (.cse2 (= v_main_~x~0_1714 v_main_~x~0_1713)) (.cse3 (= |v_main_#t~post3_626| |v_main_#t~post3_624|)) (.cse4 (= v_main_~y~0_1845 v_main_~y~0_1844))) (or (and .cse0 (< v_main_~y~0_1844 v_main_~y~0_1845) (= (+ v_main_~x~0_1714 v_main_~y~0_1845) (+ v_main_~x~0_1713 v_main_~y~0_1844)) (<= 0 v_main_~y~0_1844)) (and .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1845)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1845, main_#t~post2=|v_main_#t~post2_355|, main_#t~post3=|v_main_#t~post3_626|, main_~x~0=v_main_~x~0_1714} OutVars{main_~y~0=v_main_~y~0_1844, main_#t~post2=|v_main_#t~post2_354|, main_#t~post3=|v_main_#t~post3_624|, main_~x~0=v_main_~x~0_1713} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {36605#(and (or (<= main_~x~0 49) (<= 1 main_~y~0)) (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)))} is VALID [2022-04-28 03:19:22,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {36523#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {36612#(and (<= main_~x~0 49) (or (< (+ main_~y~0 1) 0) (<= main_~x~0 (+ 49 main_~y~0))))} is VALID [2022-04-28 03:19:22,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {36523#true} call #t~ret4 := main(); {36523#true} is VALID [2022-04-28 03:19:22,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36523#true} {36523#true} #61#return; {36523#true} is VALID [2022-04-28 03:19:22,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {36523#true} assume true; {36523#true} is VALID [2022-04-28 03:19:22,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {36523#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(9, 2); {36523#true} is VALID [2022-04-28 03:19:22,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {36523#true} call ULTIMATE.init(); {36523#true} is VALID [2022-04-28 03:19:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:22,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415908474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:22,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:22,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2022-04-28 03:19:25,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:25,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412003355] [2022-04-28 03:19:25,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412003355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:25,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:25,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-28 03:19:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876028362] [2022-04-28 03:19:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:25,756 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 148 [2022-04-28 03:19:25,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:25,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 03:19:25,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:25,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-28 03:19:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-28 03:19:25,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=9148, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:19:25,829 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 03:19:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:39,628 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-28 03:19:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-28 03:19:39,628 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 148 [2022-04-28 03:19:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 03:19:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2022-04-28 03:19:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 03:19:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2022-04-28 03:19:39,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 160 transitions. [2022-04-28 03:19:39,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:39,711 INFO L225 Difference]: With dead ends: 173 [2022-04-28 03:19:39,711 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 03:19:39,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1833, Invalid=34457, Unknown=0, NotChecked=0, Total=36290 [2022-04-28 03:19:39,713 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 143 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12130 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 12408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 12130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:39,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 188 Invalid, 12408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 12130 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 03:19:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 03:19:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-04-28 03:19:40,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:40,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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 03:19:40,130 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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 03:19:40,130 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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 03:19:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:40,132 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2022-04-28 03:19:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-28 03:19:40,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:40,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:40,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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) Second operand 158 states. [2022-04-28 03:19:40,132 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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) Second operand 158 states. [2022-04-28 03:19:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:40,133 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2022-04-28 03:19:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-28 03:19:40,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:40,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:40,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:40,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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 03:19:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2022-04-28 03:19:40,135 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 148 [2022-04-28 03:19:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:40,135 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2022-04-28 03:19:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 93 states have internal predecessors, (144), 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 03:19:40,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 162 transitions. [2022-04-28 03:19:40,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-28 03:19:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-28 03:19:40,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:19:40,372 INFO L195 NwaCegarLoop]: trace histogram [47, 46, 45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:19:40,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-28 03:19:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 03:19:40,572 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:19:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:19:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 195106819, now seen corresponding path program 47 times [2022-04-28 03:19:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:40,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [766724363] [2022-04-28 03:19:43,458 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:19:43,585 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:43,853 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:19:43,854 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:19:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1332664629, now seen corresponding path program 1 times [2022-04-28 03:19:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:19:43,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072042451] [2022-04-28 03:19:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:19:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:19:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:43,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-28 03:19:43,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 03:19:43,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 03:19:43,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:19:43,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {37889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37881#true} is VALID [2022-04-28 03:19:43,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 03:19:43,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 03:19:43,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-28 03:19:43,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37886#(= main_~x~0 0)} is VALID [2022-04-28 03:19:43,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= main_~x~0 0)} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37886#(= main_~x~0 0)} is VALID [2022-04-28 03:19:43,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {37886#(= main_~x~0 0)} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37886#(= main_~x~0 0)} is VALID [2022-04-28 03:19:43,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {37886#(= main_~x~0 0)} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:43,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:19:43,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {37887#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37888#(<= 48 main_~y~0)} is VALID [2022-04-28 03:19:43,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {37888#(<= 48 main_~y~0)} assume ~y~0 < 0; {37882#false} is VALID [2022-04-28 03:19:43,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-28 03:19:43,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 03:19:43,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 03:19:43,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 03:19:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:19:43,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:19:43,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072042451] [2022-04-28 03:19:43,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072042451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:19:43,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726913779] [2022-04-28 03:19:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:19:43,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:19:43,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:19:43,899 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:19:43,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 03:19:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:43,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:19:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:19:43,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:19:44,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-28 03:19:44,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#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(9, 2); {37881#true} is VALID [2022-04-28 03:19:44,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 03:19:44,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 03:19:44,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-28 03:19:44,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:44,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:44,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:19:44,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {37908#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:19:44,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:19:44,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {37918#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37925#(<= 49 main_~y~0)} is VALID [2022-04-28 03:19:44,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {37925#(<= 49 main_~y~0)} assume ~y~0 < 0; {37882#false} is VALID [2022-04-28 03:19:44,204 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-28 03:19:44,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 03:19:44,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 03:19:44,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 03:19:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:19:44,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:19:44,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 03:19:44,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 03:19:44,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 03:19:44,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {37882#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {37882#false} is VALID [2022-04-28 03:19:44,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {37953#(not (< main_~y~0 0))} assume ~y~0 < 0; {37882#false} is VALID [2022-04-28 03:19:44,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {37953#(not (< main_~y~0 0))} is VALID [2022-04-28 03:19:44,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} [246] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:44,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [249] L28-2-->L29_primed: Formula: (let ((.cse3 (<= 0 (+ v_main_~y~0_1911 1))) (.cse0 (= v_main_~x~0_1777 v_main_~x~0_1776)) (.cse1 (= |v_main_#t~post1_325| |v_main_#t~post1_324|)) (.cse2 (= v_main_~y~0_1911 v_main_~y~0_1910))) (or (and (= |v_main_#t~post3_643| |v_main_#t~post3_639|) .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_1777 v_main_~y~0_1910) (+ v_main_~x~0_1776 v_main_~y~0_1911)) .cse3 (< v_main_~x~0_1776 51) (< v_main_~x~0_1777 v_main_~x~0_1776)) (and (or (not (< v_main_~x~0_1777 50)) (not .cse3)) .cse0 (= |v_main_#t~post3_639| |v_main_#t~post3_643|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_1911, main_#t~post3=|v_main_#t~post3_643|, main_~x~0=v_main_~x~0_1777, main_#t~post1=|v_main_#t~post1_325|} OutVars{main_~y~0=v_main_~y~0_1910, main_#t~post3=|v_main_#t~post3_639|, main_~x~0=v_main_~x~0_1776, main_#t~post1=|v_main_#t~post1_324|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {37957#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:19:44,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [248] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:19:44,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {37971#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [247] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~x~0_1775 v_main_~x~0_1774)) (.cse1 (= v_main_~y~0_1909 v_main_~y~0_1908)) (.cse2 (= |v_main_#t~post2_363| |v_main_#t~post2_362|)) (.cse3 (<= 50 v_main_~x~0_1775))) (or (and (= |v_main_#t~post3_640| |v_main_#t~post3_638|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (<= 1 v_main_~y~0_1909)) (not .cse3)) (= |v_main_#t~post3_638| |v_main_#t~post3_640|)) (and (< v_main_~y~0_1908 v_main_~y~0_1909) (= (+ v_main_~x~0_1774 v_main_~y~0_1908) (+ v_main_~x~0_1775 v_main_~y~0_1909)) (<= 0 v_main_~y~0_1908) .cse3))) InVars {main_~y~0=v_main_~y~0_1909, main_#t~post2=|v_main_#t~post2_363|, main_#t~post3=|v_main_#t~post3_640|, main_~x~0=v_main_~x~0_1775} OutVars{main_~y~0=v_main_~y~0_1908, main_#t~post2=|v_main_#t~post2_362|, main_#t~post3=|v_main_#t~post3_638|, main_~x~0=v_main_~x~0_1774} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {37964#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:19:44,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {37971#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:19:44,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret4 := main(); {37881#true} is VALID [2022-04-28 03:19:44,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 03:19:44,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 03:19:44,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#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(9, 2); {37881#true} is VALID [2022-04-28 03:19:44,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-28 03:19:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:19:44,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726913779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:19:44,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:19:44,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:19:47,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:19:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [766724363] [2022-04-28 03:19:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [766724363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:19:47,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:19:47,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2022-04-28 03:19:47,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615209164] [2022-04-28 03:19:47,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:19:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 151 [2022-04-28 03:19:47,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:19:47,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 03:19:47,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:47,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-04-28 03:19:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:19:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-04-28 03:19:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=9542, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:19:47,276 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 03:19:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,087 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2022-04-28 03:19:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-04-28 03:19:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 151 [2022-04-28 03:19:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:19:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 03:19:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 163 transitions. [2022-04-28 03:19:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 03:19:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 163 transitions. [2022-04-28 03:19:59,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 163 transitions. [2022-04-28 03:19:59,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:19:59,181 INFO L225 Difference]: With dead ends: 177 [2022-04-28 03:19:59,181 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 03:19:59,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10824 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1701, Invalid=34971, Unknown=0, NotChecked=0, Total=36672 [2022-04-28 03:19:59,183 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 103 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 10098 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 10287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 10098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:19:59,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 390 Invalid, 10287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 10098 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 03:19:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 03:19:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2022-04-28 03:19:59,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:19:59,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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 03:19:59,851 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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 03:19:59,851 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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 03:19:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,852 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2022-04-28 03:19:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-28 03:19:59,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:59,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:59,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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) Second operand 162 states. [2022-04-28 03:19:59,852 INFO L87 Difference]: Start difference. First operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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) Second operand 162 states. [2022-04-28 03:19:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:19:59,854 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2022-04-28 03:19:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-28 03:19:59,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:19:59,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:19:59,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:19:59,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:19:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 156 states have internal predecessors, (161), 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 03:19:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2022-04-28 03:19:59,855 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 151 [2022-04-28 03:19:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:19:59,856 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2022-04-28 03:19:59,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 94 states have internal predecessors, (147), 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 03:19:59,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 165 transitions. [2022-04-28 03:20:00,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-04-28 03:20:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 03:20:00,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:00,063 INFO L195 NwaCegarLoop]: trace histogram [48, 47, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:00,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:00,263 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -372171865, now seen corresponding path program 48 times [2022-04-28 03:20:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:00,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651346865] [2022-04-28 03:20:04,423 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:20:04,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:04,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:04,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:20:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1172719563, now seen corresponding path program 1 times [2022-04-28 03:20:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948548004] [2022-04-28 03:20:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:20:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:04,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-28 03:20:04,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-28 03:20:04,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-28 03:20:04,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:20:04,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {39269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {39261#true} is VALID [2022-04-28 03:20:04,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-28 03:20:04,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-28 03:20:04,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-28 03:20:04,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39266#(= main_~x~0 0)} is VALID [2022-04-28 03:20:04,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {39266#(= main_~x~0 0)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39266#(= main_~x~0 0)} is VALID [2022-04-28 03:20:04,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {39266#(= main_~x~0 0)} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39266#(= main_~x~0 0)} is VALID [2022-04-28 03:20:04,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {39266#(= main_~x~0 0)} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:20:04,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:20:04,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {39267#(or (= main_~x~0 0) (<= main_~x~0 (+ main_~y~0 1)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39268#(<= 48 main_~y~0)} is VALID [2022-04-28 03:20:04,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {39268#(<= 48 main_~y~0)} assume ~y~0 < 0; {39262#false} is VALID [2022-04-28 03:20:04,839 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-28 03:20:04,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-28 03:20:04,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-28 03:20:04,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-28 03:20:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:20:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:04,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948548004] [2022-04-28 03:20:04,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948548004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:20:04,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956418937] [2022-04-28 03:20:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:04,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:04,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:04,840 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:20:04,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 03:20:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:04,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:20:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:04,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:05,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39261#true} is VALID [2022-04-28 03:20:05,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#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(9, 2); {39261#true} is VALID [2022-04-28 03:20:05,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-28 03:20:05,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-28 03:20:05,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-28 03:20:05,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39288#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:05,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {39288#(<= main_~x~0 0)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39288#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:05,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {39288#(<= main_~x~0 0)} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39288#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:05,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {39288#(<= main_~x~0 0)} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:20:05,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:20:05,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {39298#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39268#(<= 48 main_~y~0)} is VALID [2022-04-28 03:20:05,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {39268#(<= 48 main_~y~0)} assume ~y~0 < 0; {39262#false} is VALID [2022-04-28 03:20:05,037 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-28 03:20:05,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-28 03:20:05,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-28 03:20:05,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-28 03:20:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:20:05,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:05,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {39262#false} assume !false; {39262#false} is VALID [2022-04-28 03:20:05,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {39262#false} assume 0 == ~cond; {39262#false} is VALID [2022-04-28 03:20:05,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {39262#false} ~cond := #in~cond; {39262#false} is VALID [2022-04-28 03:20:05,355 INFO L272 TraceCheckUtils]: 12: Hoare triple {39262#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {39262#false} is VALID [2022-04-28 03:20:05,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {39332#(not (< main_~y~0 0))} assume ~y~0 < 0; {39262#false} is VALID [2022-04-28 03:20:05,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {39332#(not (< main_~y~0 0))} is VALID [2022-04-28 03:20:05,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} [250] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:05,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [253] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_1976 1))) (.cse0 (= |v_main_#t~post3_657| |v_main_#t~post3_653|)) (.cse1 (= v_main_~x~0_1839 v_main_~x~0_1838)) (.cse3 (= v_main_~y~0_1976 v_main_~y~0_1975)) (.cse4 (= |v_main_#t~post1_332| |v_main_#t~post1_331|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1839 50))) .cse3 .cse4) (and (< v_main_~x~0_1839 v_main_~x~0_1838) .cse2 (= (+ v_main_~x~0_1839 v_main_~y~0_1975) (+ v_main_~x~0_1838 v_main_~y~0_1976)) (< v_main_~x~0_1838 51)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1976, main_#t~post3=|v_main_#t~post3_657|, main_~x~0=v_main_~x~0_1839, main_#t~post1=|v_main_#t~post1_332|} OutVars{main_~y~0=v_main_~y~0_1975, main_#t~post3=|v_main_#t~post3_653|, main_~x~0=v_main_~x~0_1838, main_#t~post1=|v_main_#t~post1_331|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {39336#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:05,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [252] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:05,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {39350#(<= main_~x~0 48)} [251] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_1974 v_main_~y~0_1973)) (.cse1 (= |v_main_#t~post3_654| |v_main_#t~post3_652|)) (.cse3 (= v_main_~x~0_1837 v_main_~x~0_1836)) (.cse2 (<= 50 v_main_~x~0_1837))) (or (and (= |v_main_#t~post2_370| |v_main_#t~post2_371|) .cse0 .cse1 (or (not (<= 1 v_main_~y~0_1974)) (not .cse2)) .cse3) (and .cse0 .cse1 (= |v_main_#t~post2_371| |v_main_#t~post2_370|) .cse3) (let ((.cse4 (+ v_main_~x~0_1837 v_main_~y~0_1974))) (and (<= v_main_~x~0_1836 .cse4) (= (+ v_main_~x~0_1836 v_main_~y~0_1973) .cse4) (< v_main_~x~0_1837 v_main_~x~0_1836) .cse2)))) InVars {main_~y~0=v_main_~y~0_1974, main_#t~post2=|v_main_#t~post2_371|, main_#t~post3=|v_main_#t~post3_654|, main_~x~0=v_main_~x~0_1837} OutVars{main_~y~0=v_main_~y~0_1973, main_#t~post2=|v_main_#t~post2_370|, main_#t~post3=|v_main_#t~post3_652|, main_~x~0=v_main_~x~0_1836} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {39343#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:05,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {39261#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {39350#(<= main_~x~0 48)} is VALID [2022-04-28 03:20:05,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {39261#true} call #t~ret4 := main(); {39261#true} is VALID [2022-04-28 03:20:05,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39261#true} {39261#true} #61#return; {39261#true} is VALID [2022-04-28 03:20:05,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {39261#true} assume true; {39261#true} is VALID [2022-04-28 03:20:05,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {39261#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(9, 2); {39261#true} is VALID [2022-04-28 03:20:05,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {39261#true} call ULTIMATE.init(); {39261#true} is VALID [2022-04-28 03:20:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:05,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956418937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:05,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:20:05,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-28 03:20:07,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651346865] [2022-04-28 03:20:07,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651346865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:07,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:07,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2022-04-28 03:20:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895319428] [2022-04-28 03:20:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 154 [2022-04-28 03:20:07,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:07,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 03:20:07,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:07,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-28 03:20:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-28 03:20:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9692, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:20:07,677 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 03:20:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:18,474 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-04-28 03:20:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-04-28 03:20:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 154 [2022-04-28 03:20:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 03:20:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 166 transitions. [2022-04-28 03:20:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 03:20:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 166 transitions. [2022-04-28 03:20:18,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 166 transitions. [2022-04-28 03:20:18,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:18,555 INFO L225 Difference]: With dead ends: 180 [2022-04-28 03:20:18,555 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 03:20:18,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11089 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1824, Invalid=36006, Unknown=0, NotChecked=0, Total=37830 [2022-04-28 03:20:18,557 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 105 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9927 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 9927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:18,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 116 Invalid, 10155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 9927 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 03:20:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 03:20:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2022-04-28 03:20:18,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:18,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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 03:20:18,969 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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 03:20:18,970 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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 03:20:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:18,971 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-28 03:20:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-28 03:20:18,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:18,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:18,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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) Second operand 165 states. [2022-04-28 03:20:18,971 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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) Second operand 165 states. [2022-04-28 03:20:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:18,973 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-28 03:20:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-28 03:20:18,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:18,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:18,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:18,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 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 03:20:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-28 03:20:18,975 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 154 [2022-04-28 03:20:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:18,975 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-28 03:20:18,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 96 states have internal predecessors, (150), 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 03:20:18,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-28 03:20:19,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-28 03:20:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 03:20:19,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:19,156 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:19,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:19,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:19,372 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash 524862851, now seen corresponding path program 49 times [2022-04-28 03:20:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001774114] [2022-04-28 03:20:23,477 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:20:23,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:23,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:23,752 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:20:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash -616863541, now seen corresponding path program 1 times [2022-04-28 03:20:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:23,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980260313] [2022-04-28 03:20:23,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:20:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:23,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-28 03:20:23,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-28 03:20:23,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-28 03:20:23,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:20:23,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {40673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {40664#true} is VALID [2022-04-28 03:20:23,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-28 03:20:23,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-28 03:20:23,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-28 03:20:23,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40669#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:20:23,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {40669#(and (= main_~x~0 0) (= main_~y~0 0))} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:23,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:23,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {40670#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:23,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:23,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {40671#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40672#(<= 49 main_~y~0)} is VALID [2022-04-28 03:20:23,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {40672#(<= 49 main_~y~0)} assume ~y~0 < 0; {40665#false} is VALID [2022-04-28 03:20:23,842 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-28 03:20:23,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-28 03:20:23,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-28 03:20:23,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-28 03:20:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980260313] [2022-04-28 03:20:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980260313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:20:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957151606] [2022-04-28 03:20:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:23,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:23,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:23,848 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:20:23,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 03:20:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:23,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:20:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:23,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:24,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40664#true} is VALID [2022-04-28 03:20:24,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#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(9, 2); {40664#true} is VALID [2022-04-28 03:20:24,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-28 03:20:24,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-28 03:20:24,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-28 03:20:24,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40692#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:24,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {40692#(<= main_~x~0 0)} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40692#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:24,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {40692#(<= main_~x~0 0)} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40692#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:24,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {40692#(<= main_~x~0 0)} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:20:24,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:20:24,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {40702#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40709#(<= 48 main_~y~0)} is VALID [2022-04-28 03:20:24,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {40709#(<= 48 main_~y~0)} assume ~y~0 < 0; {40665#false} is VALID [2022-04-28 03:20:24,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-28 03:20:24,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-28 03:20:24,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-28 03:20:24,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-28 03:20:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:20:24,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:24,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#false} assume !false; {40665#false} is VALID [2022-04-28 03:20:24,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {40665#false} assume 0 == ~cond; {40665#false} is VALID [2022-04-28 03:20:24,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {40665#false} ~cond := #in~cond; {40665#false} is VALID [2022-04-28 03:20:24,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {40665#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {40665#false} is VALID [2022-04-28 03:20:24,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {40737#(not (< main_~y~0 0))} assume ~y~0 < 0; {40665#false} is VALID [2022-04-28 03:20:24,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {40737#(not (< main_~y~0 0))} is VALID [2022-04-28 03:20:24,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} [254] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:24,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [257] L28-2-->L29_primed: Formula: (let ((.cse4 (<= 0 (+ v_main_~y~0_2042 1))) (.cse0 (= |v_main_#t~post3_671| |v_main_#t~post3_667|)) (.cse1 (= |v_main_#t~post1_339| |v_main_#t~post1_338|)) (.cse2 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse3 (= v_main_~x~0_1902 v_main_~x~0_1901))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1902 50)) (not .cse4))) (and (< v_main_~x~0_1902 v_main_~x~0_1901) (= (+ v_main_~x~0_1902 v_main_~y~0_2041) (+ v_main_~x~0_1901 v_main_~y~0_2042)) (< v_main_~x~0_1901 51) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2042, main_#t~post3=|v_main_#t~post3_671|, main_~x~0=v_main_~x~0_1902, main_#t~post1=|v_main_#t~post1_339|} OutVars{main_~y~0=v_main_~y~0_2041, main_#t~post3=|v_main_#t~post3_667|, main_~x~0=v_main_~x~0_1901, main_#t~post1=|v_main_#t~post1_338|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {40741#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:24,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [256] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:24,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {40755#(<= main_~x~0 48)} [255] L28-2-->L29_primed: Formula: (let ((.cse2 (= v_main_~x~0_1900 v_main_~x~0_1899)) (.cse3 (= |v_main_#t~post2_379| |v_main_#t~post2_378|)) (.cse1 (<= 50 v_main_~x~0_1900)) (.cse4 (= |v_main_#t~post3_668| |v_main_#t~post3_666|))) (or (let ((.cse0 (+ v_main_~x~0_1900 v_main_~y~0_2040))) (and (<= v_main_~x~0_1899 .cse0) (= (+ v_main_~x~0_1899 v_main_~y~0_2039) .cse0) (< v_main_~x~0_1900 v_main_~x~0_1899) .cse1)) (and .cse2 .cse3 (= v_main_~y~0_2040 v_main_~y~0_2039) .cse4) (and (= v_main_~y~0_2039 v_main_~y~0_2040) .cse2 .cse3 (or (not (<= 1 v_main_~y~0_2040)) (not .cse1)) .cse4))) InVars {main_~y~0=v_main_~y~0_2040, main_#t~post2=|v_main_#t~post2_379|, main_#t~post3=|v_main_#t~post3_668|, main_~x~0=v_main_~x~0_1900} OutVars{main_~y~0=v_main_~y~0_2039, main_#t~post2=|v_main_#t~post2_378|, main_#t~post3=|v_main_#t~post3_666|, main_~x~0=v_main_~x~0_1899} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {40748#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:24,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {40664#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {40755#(<= main_~x~0 48)} is VALID [2022-04-28 03:20:24,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {40664#true} call #t~ret4 := main(); {40664#true} is VALID [2022-04-28 03:20:24,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40664#true} {40664#true} #61#return; {40664#true} is VALID [2022-04-28 03:20:24,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {40664#true} assume true; {40664#true} is VALID [2022-04-28 03:20:24,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {40664#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(9, 2); {40664#true} is VALID [2022-04-28 03:20:24,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {40664#true} call ULTIMATE.init(); {40664#true} is VALID [2022-04-28 03:20:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957151606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:24,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:20:24,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:20:28,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:28,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001774114] [2022-04-28 03:20:28,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001774114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:28,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:28,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [100] imperfect sequences [] total 100 [2022-04-28 03:20:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508122292] [2022-04-28 03:20:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 157 [2022-04-28 03:20:28,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:28,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 03:20:28,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:28,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-04-28 03:20:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-04-28 03:20:28,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=10744, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:20:28,398 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 03:20:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:44,861 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2022-04-28 03:20:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-28 03:20:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 157 [2022-04-28 03:20:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 03:20:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 169 transitions. [2022-04-28 03:20:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 03:20:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 169 transitions. [2022-04-28 03:20:44,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 169 transitions. [2022-04-28 03:20:44,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:44,947 INFO L225 Difference]: With dead ends: 183 [2022-04-28 03:20:44,947 INFO L226 Difference]: Without dead ends: 168 [2022-04-28 03:20:44,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5901 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1867, Invalid=39545, Unknown=0, NotChecked=0, Total=41412 [2022-04-28 03:20:44,950 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 105 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13924 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 14118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 13924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:44,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 182 Invalid, 14118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 13924 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 03:20:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-28 03:20:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2022-04-28 03:20:45,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:45,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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 03:20:45,368 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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 03:20:45,368 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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 03:20:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:45,370 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-28 03:20:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-28 03:20:45,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:45,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:45,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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) Second operand 168 states. [2022-04-28 03:20:45,371 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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) Second operand 168 states. [2022-04-28 03:20:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:45,373 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-28 03:20:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-28 03:20:45,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:45,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:45,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:45,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 162 states have internal predecessors, (167), 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 03:20:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2022-04-28 03:20:45,375 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 157 [2022-04-28 03:20:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:45,375 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2022-04-28 03:20:45,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 1.53) internal successors, (153), 99 states have internal predecessors, (153), 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 03:20:45,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 171 transitions. [2022-04-28 03:20:45,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2022-04-28 03:20:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-28 03:20:45,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:45,553 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:45,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:45,775 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash 799571495, now seen corresponding path program 50 times [2022-04-28 03:20:45,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:45,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312934879] [2022-04-28 03:20:45,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:46,148 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:20:46,149 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:20:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1888520651, now seen corresponding path program 1 times [2022-04-28 03:20:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:46,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26687463] [2022-04-28 03:20:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:20:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:46,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:20:46,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {42107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-28 03:20:46,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42103#(= main_~x~0 0)} is VALID [2022-04-28 03:20:46,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {42103#(= main_~x~0 0)} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42104#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:46,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {42104#(<= main_~x~0 0)} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42104#(<= main_~x~0 0)} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {42104#(<= main_~x~0 0)} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {42105#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42106#(<= 48 main_~y~0)} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {42106#(<= 48 main_~y~0)} assume ~y~0 < 0; {42099#false} is VALID [2022-04-28 03:20:46,194 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-28 03:20:46,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-28 03:20:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:20:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26687463] [2022-04-28 03:20:46,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26687463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:20:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115779677] [2022-04-28 03:20:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:46,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:46,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:46,196 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:20:46,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 03:20:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:46,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:20:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:46,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:20:46,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42098#true} is VALID [2022-04-28 03:20:46,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#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(9, 2); {42098#true} is VALID [2022-04-28 03:20:46,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-28 03:20:46,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-28 03:20:46,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-28 03:20:46,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:46,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:46,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:20:46,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {42126#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:20:46,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:20:46,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {42136#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42143#(<= 49 main_~y~0)} is VALID [2022-04-28 03:20:46,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {42143#(<= 49 main_~y~0)} assume ~y~0 < 0; {42099#false} is VALID [2022-04-28 03:20:46,384 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-28 03:20:46,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-28 03:20:46,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-28 03:20:46,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-28 03:20:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:20:46,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:20:46,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {42099#false} assume !false; {42099#false} is VALID [2022-04-28 03:20:46,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {42099#false} assume 0 == ~cond; {42099#false} is VALID [2022-04-28 03:20:46,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {42099#false} ~cond := #in~cond; {42099#false} is VALID [2022-04-28 03:20:46,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {42099#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {42099#false} is VALID [2022-04-28 03:20:46,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {42171#(not (< main_~y~0 0))} assume ~y~0 < 0; {42099#false} is VALID [2022-04-28 03:20:46,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {42171#(not (< main_~y~0 0))} is VALID [2022-04-28 03:20:46,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} [258] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:46,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [261] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2109 v_main_~y~0_2108)) (.cse1 (= |v_main_#t~post1_346| |v_main_#t~post1_345|)) (.cse2 (= |v_main_#t~post3_685| |v_main_#t~post3_681|)) (.cse4 (= v_main_~x~0_1966 v_main_~x~0_1965)) (.cse3 (<= 0 (+ v_main_~y~0_2109 1)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1966 50))) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_1966 v_main_~y~0_2108))) (and .cse3 (= (+ v_main_~x~0_1965 v_main_~y~0_2109) .cse5) (< .cse5 (+ 51 v_main_~y~0_2109)) (< v_main_~y~0_2109 v_main_~y~0_2108))))) InVars {main_~y~0=v_main_~y~0_2109, main_#t~post3=|v_main_#t~post3_685|, main_~x~0=v_main_~x~0_1966, main_#t~post1=|v_main_#t~post1_346|} OutVars{main_~y~0=v_main_~y~0_2108, main_#t~post3=|v_main_#t~post3_681|, main_~x~0=v_main_~x~0_1965, main_#t~post1=|v_main_#t~post1_345|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {42175#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:20:46,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [260] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:46,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {42189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} [259] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_1964)) (.cse1 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse2 (= v_main_~x~0_1964 v_main_~x~0_1963)) (.cse3 (= |v_main_#t~post3_682| |v_main_#t~post3_680|)) (.cse4 (= |v_main_#t~post2_387| |v_main_#t~post2_386|))) (or (and (<= 0 v_main_~y~0_2106) (= (+ v_main_~x~0_1964 v_main_~y~0_2107) (+ v_main_~x~0_1963 v_main_~y~0_2106)) (< v_main_~y~0_2106 v_main_~y~0_2107) .cse0) (and (or (not (<= 1 v_main_~y~0_2107)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2107, main_#t~post2=|v_main_#t~post2_387|, main_#t~post3=|v_main_#t~post3_682|, main_~x~0=v_main_~x~0_1964} OutVars{main_~y~0=v_main_~y~0_2106, main_#t~post2=|v_main_#t~post2_386|, main_#t~post3=|v_main_#t~post3_680|, main_~x~0=v_main_~x~0_1963} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {42182#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:20:46,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {42098#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {42189#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (< main_~x~0 50))} is VALID [2022-04-28 03:20:46,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {42098#true} call #t~ret4 := main(); {42098#true} is VALID [2022-04-28 03:20:46,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42098#true} {42098#true} #61#return; {42098#true} is VALID [2022-04-28 03:20:46,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {42098#true} assume true; {42098#true} is VALID [2022-04-28 03:20:46,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {42098#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(9, 2); {42098#true} is VALID [2022-04-28 03:20:46,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {42098#true} call ULTIMATE.init(); {42098#true} is VALID [2022-04-28 03:20:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:20:46,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115779677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:20:46,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:20:46,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:20:49,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:49,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312934879] [2022-04-28 03:20:49,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312934879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:49,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:49,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2022-04-28 03:20:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788886485] [2022-04-28 03:20:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 160 [2022-04-28 03:20:49,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:49,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 03:20:49,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-04-28 03:20:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-04-28 03:20:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=10956, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 03:20:49,174 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 03:21:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:03,045 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2022-04-28 03:21:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-28 03:21:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 160 [2022-04-28 03:21:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 03:21:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 180 transitions. [2022-04-28 03:21:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 03:21:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 180 transitions. [2022-04-28 03:21:03,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 180 transitions. [2022-04-28 03:21:03,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:03,134 INFO L225 Difference]: With dead ends: 191 [2022-04-28 03:21:03,134 INFO L226 Difference]: Without dead ends: 176 [2022-04-28 03:21:03,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13089 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1851, Invalid=41205, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:21:03,136 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11012 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 11012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:03,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 133 Invalid, 11263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 11012 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 03:21:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-28 03:21:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2022-04-28 03:21:03,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:03,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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 03:21:03,569 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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 03:21:03,569 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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 03:21:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:03,570 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2022-04-28 03:21:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2022-04-28 03:21:03,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:03,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:03,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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) Second operand 176 states. [2022-04-28 03:21:03,571 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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) Second operand 176 states. [2022-04-28 03:21:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:03,572 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2022-04-28 03:21:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2022-04-28 03:21:03,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:03,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:03,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:03,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 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 03:21:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2022-04-28 03:21:03,581 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 160 [2022-04-28 03:21:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:03,581 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2022-04-28 03:21:03,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 100 states have internal predecessors, (156), 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 03:21:03,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 174 transitions. [2022-04-28 03:21:03,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2022-04-28 03:21:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 03:21:03,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:03,811 INFO L195 NwaCegarLoop]: trace histogram [51, 50, 49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:03,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 03:21:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-28 03:21:04,023 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1562881277, now seen corresponding path program 51 times [2022-04-28 03:21:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:04,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2096612213] [2022-04-28 03:21:04,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:04,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:04,291 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 98937547, now seen corresponding path program 1 times [2022-04-28 03:21:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:04,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685263671] [2022-04-28 03:21:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:04,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:04,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {43585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-28 03:21:04,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-28 03:21:04,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43582#(= main_~x~0 0)} is VALID [2022-04-28 03:21:04,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {43582#(= main_~x~0 0)} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43582#(= main_~x~0 0)} is VALID [2022-04-28 03:21:04,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {43582#(= main_~x~0 0)} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43582#(= main_~x~0 0)} is VALID [2022-04-28 03:21:04,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {43582#(= main_~x~0 0)} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:04,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:04,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {43583#(or (<= main_~x~0 (+ main_~y~0 1)) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43584#(<= 48 main_~y~0)} is VALID [2022-04-28 03:21:04,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {43584#(<= 48 main_~y~0)} assume ~y~0 < 0; {43578#false} is VALID [2022-04-28 03:21:04,343 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-28 03:21:04,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-28 03:21:04,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-28 03:21:04,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-28 03:21:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:21:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685263671] [2022-04-28 03:21:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685263671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644974363] [2022-04-28 03:21:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:04,344 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:21:04,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 03:21:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:04,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:21:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:04,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:04,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43577#true} is VALID [2022-04-28 03:21:04,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#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(9, 2); {43577#true} is VALID [2022-04-28 03:21:04,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-28 03:21:04,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-28 03:21:04,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-28 03:21:04,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:04,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:04,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:04,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {43604#(and (<= 0 main_~y~0) (<= main_~x~0 0))} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:21:04,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} is VALID [2022-04-28 03:21:04,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {43614#(or (and (<= main_~x~0 main_~y~0) (< main_~x~0 51) (< 0 main_~y~0)) (and (<= 0 main_~y~0) (<= main_~x~0 0)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43621#(<= 49 main_~y~0)} is VALID [2022-04-28 03:21:04,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {43621#(<= 49 main_~y~0)} assume ~y~0 < 0; {43578#false} is VALID [2022-04-28 03:21:04,539 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-28 03:21:04,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-28 03:21:04,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-28 03:21:04,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-28 03:21:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:21:04,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:04,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {43578#false} assume !false; {43578#false} is VALID [2022-04-28 03:21:04,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {43578#false} assume 0 == ~cond; {43578#false} is VALID [2022-04-28 03:21:04,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {43578#false} ~cond := #in~cond; {43578#false} is VALID [2022-04-28 03:21:04,801 INFO L272 TraceCheckUtils]: 12: Hoare triple {43578#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {43578#false} is VALID [2022-04-28 03:21:04,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {43649#(not (< main_~y~0 0))} assume ~y~0 < 0; {43578#false} is VALID [2022-04-28 03:21:04,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {43649#(not (< main_~y~0 0))} is VALID [2022-04-28 03:21:04,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} [262] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:21:04,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [265] L28-2-->L29_primed: Formula: (let ((.cse2 (<= 0 (+ v_main_~y~0_2177 1))) (.cse0 (= v_main_~y~0_2177 v_main_~y~0_2176)) (.cse1 (= |v_main_#t~post3_699| |v_main_#t~post3_695|)) (.cse3 (= |v_main_#t~post1_353| |v_main_#t~post1_352|)) (.cse4 (= v_main_~x~0_2031 v_main_~x~0_2030))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2031 50))) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2031 v_main_~y~0_2176))) (and (< v_main_~y~0_2177 v_main_~y~0_2176) (= (+ v_main_~x~0_2030 v_main_~y~0_2177) .cse5) .cse2 (< .cse5 (+ 51 v_main_~y~0_2177)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2177, main_#t~post3=|v_main_#t~post3_699|, main_~x~0=v_main_~x~0_2031, main_#t~post1=|v_main_#t~post1_353|} OutVars{main_~y~0=v_main_~y~0_2176, main_#t~post3=|v_main_#t~post3_695|, main_~x~0=v_main_~x~0_2030, main_#t~post1=|v_main_#t~post1_352|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {43653#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:21:04,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [264] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:21:04,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {43667#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} [263] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2029)) (.cse1 (= v_main_~y~0_2175 v_main_~y~0_2174)) (.cse2 (= v_main_~x~0_2029 v_main_~x~0_2028)) (.cse3 (= |v_main_#t~post3_696| |v_main_#t~post3_694|)) (.cse4 (= |v_main_#t~post2_395| |v_main_#t~post2_394|))) (or (and (or (not (<= 1 v_main_~y~0_2175)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_2029 v_main_~y~0_2175))) (and (< v_main_~x~0_2029 v_main_~x~0_2028) (<= v_main_~x~0_2028 .cse5) (= .cse5 (+ v_main_~x~0_2028 v_main_~y~0_2174)) .cse0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2175, main_#t~post2=|v_main_#t~post2_395|, main_#t~post3=|v_main_#t~post3_696|, main_~x~0=v_main_~x~0_2029} OutVars{main_~y~0=v_main_~y~0_2174, main_#t~post2=|v_main_#t~post2_394|, main_#t~post3=|v_main_#t~post3_694|, main_~x~0=v_main_~x~0_2028} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {43660#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:21:04,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {43577#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {43667#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0))) (not (<= 50 main_~x~0)))} is VALID [2022-04-28 03:21:04,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {43577#true} call #t~ret4 := main(); {43577#true} is VALID [2022-04-28 03:21:04,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43577#true} {43577#true} #61#return; {43577#true} is VALID [2022-04-28 03:21:04,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {43577#true} assume true; {43577#true} is VALID [2022-04-28 03:21:04,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {43577#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(9, 2); {43577#true} is VALID [2022-04-28 03:21:04,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {43577#true} call ULTIMATE.init(); {43577#true} is VALID [2022-04-28 03:21:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644974363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:04,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-04-28 03:21:07,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2096612213] [2022-04-28 03:21:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2096612213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2022-04-28 03:21:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897191997] [2022-04-28 03:21:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:07,347 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 163 [2022-04-28 03:21:07,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:07,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 03:21:07,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-04-28 03:21:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-04-28 03:21:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=11164, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:21:07,416 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 03:21:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:20,369 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-28 03:21:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-28 03:21:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 163 [2022-04-28 03:21:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 03:21:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 179 transitions. [2022-04-28 03:21:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 03:21:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 179 transitions. [2022-04-28 03:21:20,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 179 transitions. [2022-04-28 03:21:20,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:20,554 INFO L225 Difference]: With dead ends: 189 [2022-04-28 03:21:20,554 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 03:21:20,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13248 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1873, Invalid=42017, Unknown=0, NotChecked=0, Total=43890 [2022-04-28 03:21:20,556 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 114 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 11610 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 11610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:20,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 338 Invalid, 11834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 11610 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 03:21:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 03:21:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-04-28 03:21:21,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:21,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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 03:21:21,028 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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 03:21:21,029 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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 03:21:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:21,030 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-28 03:21:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:21:21,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:21,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:21,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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) Second operand 174 states. [2022-04-28 03:21:21,030 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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) Second operand 174 states. [2022-04-28 03:21:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:21,032 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-28 03:21:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:21:21,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:21,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:21,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:21,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0297619047619047) internal successors, (173), 168 states have internal predecessors, (173), 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 03:21:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2022-04-28 03:21:21,034 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 163 [2022-04-28 03:21:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:21,034 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2022-04-28 03:21:21,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 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 03:21:21,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 177 transitions. [2022-04-28 03:21:21,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-28 03:21:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 03:21:21,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:21,295 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:21,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-28 03:21:21,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 03:21:21,502 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 235667623, now seen corresponding path program 52 times [2022-04-28 03:21:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:21,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082708869] [2022-04-28 03:21:25,624 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:21:25,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:25,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:25,925 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1690645557, now seen corresponding path program 1 times [2022-04-28 03:21:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:25,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798544272] [2022-04-28 03:21:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:25,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-28 03:21:25,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-28 03:21:25,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-28 03:21:25,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:25,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {45066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {45057#true} is VALID [2022-04-28 03:21:25,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-28 03:21:25,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-28 03:21:25,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-28 03:21:25,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45062#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 03:21:25,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {45062#(and (= main_~x~0 0) (= main_~y~0 0))} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:25,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:25,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {45063#(and (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:25,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:21:25,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45065#(<= 49 main_~y~0)} is VALID [2022-04-28 03:21:25,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {45065#(<= 49 main_~y~0)} assume ~y~0 < 0; {45058#false} is VALID [2022-04-28 03:21:25,979 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-28 03:21:25,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-28 03:21:25,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-28 03:21:25,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-28 03:21:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798544272] [2022-04-28 03:21:25,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798544272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780490692] [2022-04-28 03:21:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:25,980 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:21:25,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 03:21:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:26,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:21:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:26,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:26,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45057#true} is VALID [2022-04-28 03:21:26,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#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(9, 2); {45057#true} is VALID [2022-04-28 03:21:26,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-28 03:21:26,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-28 03:21:26,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-28 03:21:26,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45085#(<= main_~x~0 0)} is VALID [2022-04-28 03:21:26,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {45085#(<= main_~x~0 0)} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45085#(<= main_~x~0 0)} is VALID [2022-04-28 03:21:26,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {45085#(<= main_~x~0 0)} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45085#(<= main_~x~0 0)} is VALID [2022-04-28 03:21:26,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {45085#(<= main_~x~0 0)} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:21:26,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} is VALID [2022-04-28 03:21:26,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {45095#(or (<= main_~x~0 0) (and (<= main_~x~0 (+ main_~y~0 1)) (< main_~x~0 51)))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45102#(<= 48 main_~y~0)} is VALID [2022-04-28 03:21:26,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {45102#(<= 48 main_~y~0)} assume ~y~0 < 0; {45058#false} is VALID [2022-04-28 03:21:26,204 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-28 03:21:26,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-28 03:21:26,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-28 03:21:26,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-28 03:21:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:21:26,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:26,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {45058#false} assume !false; {45058#false} is VALID [2022-04-28 03:21:26,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {45058#false} assume 0 == ~cond; {45058#false} is VALID [2022-04-28 03:21:26,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {45058#false} ~cond := #in~cond; {45058#false} is VALID [2022-04-28 03:21:26,605 INFO L272 TraceCheckUtils]: 12: Hoare triple {45058#false} call __VERIFIER_assert((if 100 == ~x~0 then 1 else 0)); {45058#false} is VALID [2022-04-28 03:21:26,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {45130#(not (< main_~y~0 0))} assume ~y~0 < 0; {45058#false} is VALID [2022-04-28 03:21:26,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} assume !(~x~0 < 50);#t~post2 := ~y~0;~y~0 := #t~post2 - 1;havoc #t~post2; {45130#(not (< main_~y~0 0))} is VALID [2022-04-28 03:21:26,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} [266] L29_primed-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:21:26,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [269] L28-2-->L29_primed: Formula: (let ((.cse0 (= v_main_~y~0_2246 v_main_~y~0_2245)) (.cse2 (<= 0 (+ v_main_~y~0_2246 1))) (.cse1 (= v_main_~x~0_2097 v_main_~x~0_2096))) (or (and (= |v_main_#t~post3_713| |v_main_#t~post3_709|) .cse0 (= |v_main_#t~post1_360| |v_main_#t~post1_359|) .cse1) (and (= (+ v_main_~x~0_2096 v_main_~y~0_2246) (+ v_main_~x~0_2097 v_main_~y~0_2245)) (< v_main_~x~0_2097 v_main_~x~0_2096) .cse2 (< v_main_~x~0_2096 51)) (and (= |v_main_#t~post3_709| |v_main_#t~post3_713|) (= |v_main_#t~post1_359| |v_main_#t~post1_360|) .cse0 (or (not (< v_main_~x~0_2097 50)) (not .cse2)) .cse1))) InVars {main_~y~0=v_main_~y~0_2246, main_#t~post3=|v_main_#t~post3_713|, main_~x~0=v_main_~x~0_2097, main_#t~post1=|v_main_#t~post1_360|} OutVars{main_~y~0=v_main_~y~0_2245, main_#t~post3=|v_main_#t~post3_709|, main_~x~0=v_main_~x~0_2096, main_#t~post1=|v_main_#t~post1_359|} AuxVars[] AssignedVars[main_~x~0, main_#t~post1, main_~y~0, main_#t~post3] {45134#(or (< main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-28 03:21:26,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} [268] L29_primed-->L28-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:21:26,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {45148#(<= main_~x~0 48)} [267] L28-2-->L29_primed: Formula: (let ((.cse0 (<= 50 v_main_~x~0_2095)) (.cse1 (= |v_main_#t~post2_403| |v_main_#t~post2_402|)) (.cse2 (= v_main_~y~0_2244 v_main_~y~0_2243))) (or (and .cse0 (< v_main_~y~0_2243 v_main_~y~0_2244) (<= 0 v_main_~y~0_2243) (= (+ v_main_~x~0_2094 v_main_~y~0_2243) (+ v_main_~x~0_2095 v_main_~y~0_2244))) (and .cse1 (= v_main_~x~0_2094 v_main_~x~0_2095) (or (not (<= 1 v_main_~y~0_2244)) (not .cse0)) (= |v_main_#t~post3_708| |v_main_#t~post3_710|) .cse2) (and .cse1 (= v_main_~x~0_2095 v_main_~x~0_2094) (= |v_main_#t~post3_710| |v_main_#t~post3_708|) .cse2))) InVars {main_~y~0=v_main_~y~0_2244, main_#t~post2=|v_main_#t~post2_403|, main_#t~post3=|v_main_#t~post3_710|, main_~x~0=v_main_~x~0_2095} OutVars{main_~y~0=v_main_~y~0_2243, main_#t~post2=|v_main_#t~post2_402|, main_#t~post3=|v_main_#t~post3_708|, main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2, main_#t~post3] {45141#(and (or (not (<= 0 (+ main_~y~0 1))) (<= main_~x~0 (+ 49 main_~y~0)) (<= 50 main_~x~0)) (or (< main_~x~0 50) (<= 1 main_~y~0)))} is VALID [2022-04-28 03:21:26,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {45057#true} havoc ~x~0;havoc ~y~0;~x~0 := 0;~y~0 := 0; {45148#(<= main_~x~0 48)} is VALID [2022-04-28 03:21:26,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {45057#true} call #t~ret4 := main(); {45057#true} is VALID [2022-04-28 03:21:26,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45057#true} {45057#true} #61#return; {45057#true} is VALID [2022-04-28 03:21:26,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {45057#true} assume true; {45057#true} is VALID [2022-04-28 03:21:26,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {45057#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(9, 2); {45057#true} is VALID [2022-04-28 03:21:26,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {45057#true} call ULTIMATE.init(); {45057#true} is VALID [2022-04-28 03:21:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:26,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780490692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:26,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:26,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-04-28 03:21:30,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082708869] [2022-04-28 03:21:30,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082708869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:30,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:30,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2022-04-28 03:21:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813341950] [2022-04-28 03:21:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.5) internal successors, (162), 107 states have internal predecessors, (162), 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 166 [2022-04-28 03:21:30,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:30,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 108 states, 108 states have (on average 1.5) internal successors, (162), 107 states have internal predecessors, (162), 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 03:21:30,951 WARN L143 InductivityCheck]: Transition 45268#(and (= 49 main_~y~0) (= 51 main_~x~0)) ( _ , assume !false; , 45064#(or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) ) not inductive [2022-04-28 03:21:30,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 03:21:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:31,164 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 03:21:31,166 INFO L158 Benchmark]: Toolchain (without parser) took 537166.06ms. Allocated memory was 179.3MB in the beginning and 388.0MB in the end (delta: 208.7MB). Free memory was 127.4MB in the beginning and 106.6MB in the end (delta: 20.7MB). Peak memory consumption was 229.1MB. Max. memory is 8.0GB. [2022-04-28 03:21:31,166 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:21:31,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.03ms. Allocated memory is still 179.3MB. Free memory was 127.2MB in the beginning and 151.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 03:21:31,167 INFO L158 Benchmark]: Boogie Preprocessor took 22.61ms. Allocated memory is still 179.3MB. Free memory was 151.9MB in the beginning and 150.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:21:31,167 INFO L158 Benchmark]: RCFGBuilder took 221.68ms. Allocated memory is still 179.3MB. Free memory was 150.3MB in the beginning and 139.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:21:31,167 INFO L158 Benchmark]: TraceAbstraction took 536737.66ms. Allocated memory was 179.3MB in the beginning and 388.0MB in the end (delta: 208.7MB). Free memory was 138.8MB in the beginning and 106.6MB in the end (delta: 32.1MB). Peak memory consumption was 241.2MB. Max. memory is 8.0GB. [2022-04-28 03:21:31,167 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.09ms. Allocated memory is still 179.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.03ms. Allocated memory is still 179.3MB. Free memory was 127.2MB in the beginning and 151.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.61ms. Allocated memory is still 179.3MB. Free memory was 151.9MB in the beginning and 150.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.68ms. Allocated memory is still 179.3MB. Free memory was 150.3MB in the beginning and 139.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 536737.66ms. Allocated memory was 179.3MB in the beginning and 388.0MB in the end (delta: 208.7MB). Free memory was 138.8MB in the beginning and 106.6MB in the end (delta: 32.1MB). Peak memory consumption was 241.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:21:31,222 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...